Single-machine scheduling with time window-dependent processing times

In the one-machine scheduling problems analysed in this paper, the processing time of a job depends on the time at which the job is started. More precisely, the horizon is divided into time windows and with each one a coefficient is associated that is used to determine the actual processing time of...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society 2006-02, Vol.57 (2), p.133-139
Main Authors: Lahlou, C, Dauzère-Pérès, S
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Computational Complexity
Computer Science
Exact sciences and technology
Integers
Job shops
Mathematical models
Modeling
one-machine
Operational research and scientific management
Operational research. Management science
Operations Research
Polynomials
Production scheduling
Schedules
Scheduling
Scheduling, sequencing
Sequential scheduling
Studies
Theoretical Papers
Time dependence
Time windows
time-dependent processing time
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the one-machine scheduling problems analysed in this paper, the processing time of a job depends on the time at which the job is started. More precisely, the horizon is divided into time windows and with each one a coefficient is associated that is used to determine the actual processing time of a job starting in it. Two models are introduced, and one of them has direct connections with models considered in previous papers on scheduling problems with time-dependent processing times. Various computational complexity results are presented for the makespan criterion, which show that the problem is NP-hard, even with two time windows. Solving procedures are also proposed for some special cases.
ISSN:0160-5682
1476-9360
0160-5682
DOI:10.1057/palgrave.jors.2601931