Scheduling dedicated jobs with variative processing times

Maksim Barketau (), Erwin Pesch () and Yakov Shafransky ()
Additional contact information
Maksim Barketau: United Institute of Informatics Problems of the National Academy of Sciences
Erwin Pesch: University of Siegen
Yakov Shafransky: United Institute of Informatics Problems of the National Academy of Sciences

Journal of Combinatorial Optimization, 2016, vol. 31, issue 2, No 19, 774-785

Abstract: Abstract We consider the following optimization problem. There is a set of $$n$$ n dedicated jobs that are to be processed on $$m$$ m parallel machines. The job set is partitioned into subsets and jobs of each subset have a common due date. Processing times of jobs are interconnected and they are the subject of the decision making. The goal is to choose a processing time for each job in a feasible way and to construct a schedule that minimizes the maximum lateness. We show that the problem is NP-hard even if $$m=1$$ m = 1 and that it is NP-hard in the strong sense if $$m$$ m is a variable. We prove that there is no approximate polynomial algorithm with guaranteed approximation ratio less than 2. We propose an integer linear formulation for the problem and perform experiments. The experiments show that the solutions obtained with CPLEX within the limit of 5 min are on average about 5 % from the optimum value for instances with up to 150 jobs, 16 subsets and 11 machines. Most instances were solved to optimality and the average CPLEX running time was 32 s for these instances.

Keywords: Bipartite graph; Maximal matching; $$NP$$ N P -hardness; Integer linear programming; Rail-rail yard (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9787-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9787-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9787-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().