Journal ArticleDOI
Single machine scheduling with release times, deadlines and tardiness objectives
TLDR
A polynomial time algorithm to minimize maximum tardiness on a single machine in the presence of deadlines can be extended only when deadlines and due dates are compatible and all job release times are equal.About:
This article is published in European Journal of Operational Research.The article was published on 2001-01-01. It has received 20 citations till now. The article focuses on the topics: Tardiness & Single-machine scheduling.read more
Citations
More filters
Journal ArticleDOI
Rescheduling for New Orders
Nicholas G. Hall,Chris N. Potts +1 more
TL;DR: This paper considers scheduling problems where a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives and creates a disruption, and provides either an efficient algorithm or a proof that such an algorithm is unlikely to exist.
Journal ArticleDOI
The single-machine total tardiness scheduling problem: Review and extensions
TL;DR: The latest theoretical developments for the single-machine total tardiness 1 / / T ¯ scheduling problem are reviewed and extensions to some of them are proposed.
Journal ArticleDOI
Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information
TL;DR: Two new algorithms to efficiently compute YC dispatching sequences that are provably optimal within the planning window are presented and are able to find within seconds optimal solutions for heavy workload scenarios with over 2.4x10^1^8 possible dispatches.
Journal ArticleDOI
Single-machine scheduling with deadlines to minimize the total weighted late work
TL;DR: In this article, the authors consider the problem of scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline.
Journal ArticleDOI
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
Roberto Cordone,Pierre Hosteins +1 more
TL;DR: This work proposes a branch-and-bound algorithm and proves its efficiency by comparing it to an e-constrained approach on benchmark instances based on those proposed in the literature on similar problems.
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
Minimizing total tardiness on one machine is NP-hard
Jianzhong Du,Joseph Y.-T. Leung +1 more
TL;DR: The problem of minimizing the total tardiness for a set of independent jobs on one machine is considered and is shown to be NP-hard in the ordinary sense.
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.