Journal ArticleDOI
Single machine scheduling with maximum earliness and number tardy
Meral Azizoglu,Suna Kondakci,Murat Köksalan +2 more
- Vol. 45, Iss: 2, pp 257-268
TLDR
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 for bicriteria problems is developed.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.read more
Citations
More filters
Journal ArticleDOI
Multi-objective production scheduling: a survey
TL;DR: In this article, the authors provide an extensive review of the literature on the scheduling problems with multiple objectives in the past 13 years and present some problems receiving less attention than the others.
Journal ArticleDOI
Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
TL;DR: A heuristic algorithm with time complexity O( n 3 ) and a branch and bound algorithm to solve a single machine scheduling problem with dual criteria, i.e., the minimization of the total weighted earliness subject to minimum number of tardy jobs is developed.
Journal ArticleDOI
The use of a fuzzy multi-objective linear programming for solving a multi-objective single-machine scheduling problem
TL;DR: Computational results show that the proposed FMOLP model achieves lower objective functions and higher satisfaction degrees.
Journal ArticleDOI
Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
TL;DR: This paper minimize the weighted and unweighted number of tardy jobs on a single batch processing machine with incompatible job families and suggests a random key genetic algorithm (RKGA) to solve this scheduling problem.
Journal ArticleDOI
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
TL;DR: This work considers the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine and proposes four new heuristics to solve this multiobjective scheduling problem based on beam search methodology.
References
More filters
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Book ChapterDOI
Complexity of machine scheduling problems
TL;DR: In this paper, the authors survey and extend the results on the complexity of machine scheduling problems and give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity.
Journal ArticleDOI
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
TL;DR: In this paper, an algorithm was proposed for sequencing n jobs through a single facility to minimize the number of late jobs, where each job is associated with a continuous, monotone non-decreasing deferral cost function.
Journal ArticleDOI
Solving a bicriterion scheduling problem
TL;DR: A pseudo-polynomial algorithm is given to enumerate all these efficient points to minimize the holding cost and the maximum tardiness of n jobs to be sequenced on a single machine.
Journal ArticleDOI
Single machine scheduling to minimize weighted earliness subject to no tardy jobs
Suresh Chand,Hans Schneeberger +1 more
TL;DR: Both exact and approximate methods are developed to solve the single machine scheduling problem where the objective is to minimize the total weighted earliness subject to no tardy jobs.