Volume 54, Number 2, March-April 2020
|Page(s)||555 - 568|
|Published online||03 March 2020|
Scheduling job shop problems with operators with respect to the maximum lateness
Département d’Informatique et Mathématique Université du Québec à Chicoutimi, Saguenay, QC G7H 2B1, Canada
2 Département de Mathématiques et Génie Industriel École polytechnique de Montréal, Montréal, QC H3T 1J4, Canada
* Corresponding author: firstname.lastname@example.org
Accepted: 13 December 2019
This paper deals with the problem of assigning operators to jobs, within a free assignment-changing mode, in a job-shop environment subject to a fixed processing sequence of the jobs. We seek an assignment of operators that minimizes the maximum lateness. Within this model, a job needs an operator during the entire duration of its processing. We show that the problem is 𝒩𝒫-hard when the number of operators is arbitrary and exhibit polynomial time algorithms for the cases involving one and two operators, respectively.
Mathematics Subject Classification: 90B35
Key words: Scheduling / job shop / operators / maximum lateness
© EDP Sciences, ROADEF, SMAI 2020
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.