Journal ArticleDOI
A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
TLDR
In this paper, a counterexample is given for Carlier's contention that if a schedule obtained by Schrage's algorithm is optimal, then there exists a set of jobs J such that the makespan of the Schrage schedule is equal to min i e J a i + Σ ieJ d i + min; iϵJ q i where a i, d i and q i is the release date, processing time and the tail of job i, respectively.About:
This article is published in European Journal of Operational Research.The article was published on 1986-02-01. It has received 25 citations till now. The article focuses on the topics: Job shop scheduling.read more
Citations
More filters
Sequencing and scheduling: algorithms and complexity
TL;DR: This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
Book ChapterDOI
Chapter 9 Sequencing and scheduling: Algorithms and complexity
TL;DR: Different types of sequencing and scheduling problems are discussed, and different types of algorithms and the concepts of complexity theory are described.
Journal ArticleDOI
The Job Shop Scheduling Problem: Conventional and new Solution Techniques
TL;DR: A job shop consists of a set of different machines that perform operations on jobs, each job is composed of an ordered list of operations each of which is determined by the machine required and the processing time on it.
Book ChapterDOI
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
TL;DR: This work focuses on deterministic machine scheduling for which it is assumed that all data that define a problem instance are known with certainty.
Journal ArticleDOI
An approximation algorithm for a single-machine scheduling problem with release times and delivery times
TL;DR: A 3/2-approximation algorithm which runs in O(n log n) time and a new robust lower bound for this problem of scheduling jobs with release times and delivery times is presented.
References
More filters
Journal ArticleDOI
The one-machine sequencing problem
TL;DR: In this article, the Schrage tree search problem has been shown to be NP-hard in the strong sense, and it is shown that the difference between the optimum and Schrage schedule is less than d 1.
Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
TL;DR: The analysis of some heuristics or approximation algorithms which never deviate by more than 100% from the optimum is focused on.
Journal ArticleDOI
Technical Note-Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
TL;DR: In this paper, a single machine sequencing problem is considered in which each job has a release date, a processing time and a delivery time, and the objective is to find a sequence of jobs which minimizes the time by which all jobs are delivered.
Related Papers (5)
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
Graham McMahon,Michael Florian +1 more