Single machine scheduling with maximum earliness and number tardy

Authors:
Meral Azizoglu;Suna Kondakci;Murat Köksalan
Affiliations:
Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey;Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey;Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey
Venue:
Computers and Industrial Engineering - Special issue: Selected papers from the 25th international conference on computers & industrial engineering in New Orleans, Louisiana
Year:
2003

Citing 1
Cited 4

Single machine scheduling to minimize weighted earliness subject to maximum tardiness

Computers and Operations Research

The use of a fuzzy multi-objective linear programming for solving a multi-objective single-machine scheduling problem

Applied Soft Computing
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem

Computers & Mathematics with Applications
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

Computers & Mathematics with Applications
Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 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.