Single machine scheduling with maximum earliness and number tardy

Date

2003-08-01

Author

Azizoğlu, Meral
Koksalan, M

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

200
views

0
downloads

In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite function of the two criteria by evaluating only a small fraction of the efficient solutions. We adapt the general procedures for the bicriteria problem of minimizing maximum earliness and the number of tardy jobs.

Subject Keywords

General Engineering, General Computer Science

URI

https://hdl.handle.net/11511/47917

Journal

COMPUTERS & INDUSTRIAL ENGINEERING

DOI

https://doi.org/10.1016/s0360-8352(03)00034-2

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Beam search algorithm for capacity allocation problem in flexible manufacturing systems Ozpeynirci, Selin Bilgin; Azizoğlu, Meral (Elsevier BV, 2009-05-01) This study considers the operation assignment and tool allocation problem in flexible manufacturing systems. A set of operations together with their required tools are selected so as to maximize the total weight. The machines have limited time and tool magazine capacities and the tools are available in limited quantities. We develop a beam search algorithm and obtain near optimal solutions for large size problems very quickly.
A unifying grid approach for solving potential flows applicable to structured and unstructured grid configurations Cete, A. Ruhsen; Yuekselen, M. Adil; Kaynak, Uenver (Elsevier BV, 2008-01-01) In this study, an efficient numerical method is proposed for unifying the structured and unstructured grid approaches for solving the potential flows. The new method, named as the "alternating cell directions implicit - ACDI", solves for the structured and unstructured grid configurations equally well. The new method in effect applies a line implicit method similar to the Line Gauss Seidel scheme for complex unstructured grids including mixed type quadrilateral and triangle cells. To this end, designated al...
Personnel assignment problem with hierarchical ordering constraints Toroslu, İsmail Hakkı (Elsevier BV, 2003-10-01) In the standard assignment problem, there is no constraint on the partitions of the bipartite graph. The only objective is to maximize the summation of the weights of the matched edges. Any node in one partition can be matched with any node in the other partition without any restriction. In this paper, we study a variation of the standard assignment problem, having some ordering constraints on the partitions of the bipartite graph. We call this problem as 'assignment problem with hierarchical ordering const...
A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect Tirkolaee, Erfan Babaee; Aydin, Nadi Serhan; Ranjbar-Bourani, Mehdi; Weber, Gerhard Wilhelm (Elsevier BV, 2020-11-01) This paper proposes a novel bi-objective mixed-integer linear programming (MILP) model for allocating and scheduling disaster rescue units considering the learning effect. When a natural phenomenon (e.g., earthquake or flood) occurs, the presented decision support model is expected to help decision-makers of emergency relief centers to provide efficient planning for rescue units to minimize the total weighted completion time of rescue operations, as well as the total delay in rescue operations. The problem ...
Cyclic ordering policies from capacitated suppliers under limited cycle time EKİCİ, ALİ; Ozener, Okan Orsan; Duran, Serhan (Elsevier BV, 2019-02-01) In this paper, we study the ordering policy of a manufacturer/retailer which procures a single item from multiple capacitated suppliers and satisfies an exogenous deterministic and constant demand. Manufacturer's objective is to minimize total periodic ordering cost which has three components: (i) fixed ordering cost, (ii) variable purchasing cost, and (iii) inventory holding cost. We are interested in developing a cyclic ordering policy for the manufacturer where the orders are repeated with a certain freq...

Citation Formats

M. Azizoğlu and M. Koksalan, “Single machine scheduling with maximum earliness and number tardy,” COMPUTERS & INDUSTRIAL ENGINEERING, pp. 257–268, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47917.