×

Optimal timing of a sequence of tasks with general completion costs. (English) Zbl 1112.90340

Summary: Scheduling a sequence of tasks–in the acceptation of finding the execution times–is not a trivial problem when the optimization criterion is irregular as for instance in earliness-tardiness problems. This paper presents an efficient dynamic programming algorithm to solve the problem with general cost functions depending on the end time of the tasks, idle time costs and variable durations also depending on the execution time of the tasks. The algorithm is also valid when the precedence graph is a tree and it can be adapted to determine the possible execution windows for each task not exceeding a maximum fixed cost.

MSC:

90B35 Deterministic scheduling theory in operations research
90C39 Dynamic programming

Software:

ILOG SCHEDULE
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Adams, J.; Balas, E.; Zawack, D., The shifting bottleneck procedure for job shop scheduling, Management Science, 34, 391-401 (1988) · Zbl 0637.90051
[2] Baptiste, Ph.; Le Pape, C.; Nuijten, W., Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems (2001), Kluwer Academic Publishers: Kluwer Academic Publishers Norwell, MA · Zbl 1094.90002
[3] Bellman, R., Dynamic Programming (1957), Princeton University Press: Princeton University Press Princeton, NJ · Zbl 0077.13605
[4] Chrétienne, Ph.; Sourd, F., Scheduling with convex cost functions, Theoretical Computer Science, 292, 145-164 (2003) · Zbl 1059.90066
[5] Della Croce, F.; Trubian, M., Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints, Production Planning and Control, 13, 133-142 (2002)
[6] Davis, J. S.; Kanet, J. J., Single machine scheduling with early and tardy completion costs, Naval Research Logistics, 40, 85-101 (1993) · Zbl 0769.90048
[7] Fry, T. D.; Armstrong, R. D.; Blackstone, J. H., Minimize weighted absolute deviation in single machine scheduling, IIE Transactions, 19, 445-450 (1987)
[8] Garey, M. R.; Tarjan, R. E.; Wilfong, G. T., One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research, 13, 330-348 (1988) · Zbl 0671.90033
[9] Gordon, V.; Proth, J. M.; Chu, C., A survey of the state-of-the-art of common due date assignment and scheduling research, European Journal of Operational Research, 139, 125 (2002)
[10] Hoogeveen, J. A.; van de Velde, S. L., A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time, INFORMS Journal on Computing, 8, 402-412 (1996) · Zbl 0884.90102
[11] ILOG Inc., ILOG Scheduler 5.2 User’s Manual and Reference Manual, December 2001; ILOG Inc., ILOG Scheduler 5.2 User’s Manual and Reference Manual, December 2001
[12] Lakshminarayan, S.; Lakshmanan, R.; Papineau, R. L.; Rochete, R., Optimal single-machine scheduling with earliness and tardiness penalties, Operations Research, 26, 6, 1079-1082 (1978) · Zbl 0413.90031
[13] Möhring, R. H.; Schulz, A. S.; Stork, F.; Uetz, M., On project scheduling with irregular starting time costs, Operations Research Letters, 28, 149-154 (2001) · Zbl 1027.90040
[14] Sourd, F.; Kedad-Sidhoum, S., The one machine problem with earliness and tardiness penalties, Journal of Scheduling, 6, 533-549 (2003) · Zbl 1154.90490
[15] Szwarc, W.; Mukhopadhyay, S. K., Optimal timing schedules in earliness-tardiness single machine sequencing, Naval Research Logistics, 42, 1109-1114 (1995) · Zbl 0841.90078
[16] Wan, G.; Yen, B. P.C., Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, European Journal of Operational Research, 142, 271-281 (2002) · Zbl 1082.90531
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.