Makespan optimization in a single-machine scheduling problem with dynamic job ready times—Complexity and algorithms

An industrial problem encountered in steel mills is considered in the paper. The problem is formulated as a single-processor scheduling problem with a dynamic model of the task release date. In this model, a task is released for processing when its preprocessing is in the final state. The instantane...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 182; pp. 162 - 168
Main Authors:	Gorczyca, Mateusz, Janiak, Adam, Janiak, Wladyslaw, Dymański, Marcin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 19.02.2015
Subjects:	Algorithms Computational complexity Iron and steel plants Mathematical models Metaheuristics Preprocessing Reduction Resource allocation Scheduling Simulated annealing Steel mills Tasks Scheduling Metaheuristics Computational complexity Resource allocation
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!