BICRITERIA SCHEDULING PROBLEM INVOLVING TOTAL TARDINESS AND TOTAL EARLINESS PENALTIES

Date

1991-10-01

Author

Azizoğlu, Meral
KIRCA, O

Metadata

Show full item record

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

Item Usage Stats

32
views

0
downloads

This paper considers the problem of minimizing the weighted sum of earliness and tardiness penalties on a single machine. A simple and efficient lower bound is developed and several upper bounds are proposed. A branch and bound procedure incorporating the bounds, precedence relations and dominance properties is proposed. An experiment is designed to test the efficiency of the bounds, precedence relations, etc. Computational experience with problems up to 20 jobs is reported.

URI

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

Journal

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS

DOI

https://doi.org/10.1016/0925-5273(91)90044-t

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Optimal Policy Synthesis from A Sequence of Goal Sets with An Application to Electric Distribution System Restoration Isik, Ilker; Arpalı, Onur Yigit; Aydın Göl, Ebru (2021-01-01) Motivated by the post-disaster distribution system restoration problem, in this paper, we study the problem of synthesizing the optimal policy for a Markov Decision Process (MDP) from a sequence of goal sets. For each goal set, our aim is to both maximize the probability to reach and minimize the expected time to reach the goal set. The order of the goal sets represents their priority. In particular, our aim is to generate a policy that is optimal with respect to the first goal set, and it is optimal with r...
Scheduling with bicriteria: total flowtime and number of tardy jobs Kondakci, SK; Bekiroglu, T (1997-11-06) In this paper the problem of minimizing total flowtime and number of tardy jobs on a single machine is considered. Some properties of the nondominated solutions are discussed. Computational results on the usefulness of developed properties for problems having up to 30 jobs are reported.
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem Tozkapan, A; Kirca, O; Chung, CS (2003-02-01) In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizing the total weighted flowtime. A lower bounding procedure and a dominance criterion are developed and incorporated into a branch and bound procedure. A heuristic procedure is also used to derive an initial upper bound. Computational results of the algorithm are presented.
Multidimensional assortment problem with an application Tripathy, A; Süral, Haldun; Gerchak, Y (1999-05-01) This paper addresses the discrete multidimensional assortment problem. Assortment issues arise frequently in practice as an important design and inventory problem which simultaneously seeks the answers to two related questions: (a) Which items (or sizes of a product) to stock? (b) How much of each to stock? its discrete multidimensional version concerns itself with choosing sizes from among a discrete set of possible ones with each size being characterized by more than one dimension. Our research is motivat...
Single machine scheduling with maximum earliness and number tardy Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01) 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 fu...

Citation Formats

M. Azizoğlu and O. KIRCA, “BICRITERIA SCHEDULING PROBLEM INVOLVING TOTAL TARDINESS AND TOTAL EARLINESS PENALTIES,” INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, pp. 17–24, 1991, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38192.