Optimally rescheduling jobs with a Last-In-First-Out buffer

This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts, e.g., due to changes in the job data or because of the local o...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 24; no. 6; pp. 663 - 680
Main Authors:	Nicosia, Gaia, Pacifici, Andrea, Pferschy, Ulrich, Resch, Julia, Righini, Giovanni
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2021 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Buffers Business and Management Calculus of Variations and Optimal Control; Optimization Completion time Dynamic programming Job shops Lateness Operations Research/Decision Theory Optimization Polynomials Rescheduling Supply Chain Management Supply chains Dynamic programming algorithms Scheduling Rescheduling Supply chain sustainability Sequence coordination Complexity
ISSN:	1094-6136, 1099-1425
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!