On the parameterized tractability of the just-in-time flow-shop scheduling problem

Danny Hermelin (), Dvir Shabtay () and Nimrod Talmon ()
Additional contact information
Danny Hermelin: Ben-Gurion University of the Negev
Dvir Shabtay: Ben-Gurion University of the Negev
Nimrod Talmon: Ben-Gurion University of the Negev

Journal of Scheduling, 2019, vol. 22, issue 6, No 4, 663-676

Abstract: Abstract We study the parameterized complexity of a set of flow-shop scheduling problems in which the objective is to maximize the weighted number of just-in-time jobs. Our analysis focuses on the case where the number of due dates is considerably smaller than the number of jobs and thus can be considered as a parameter. We prove that the two-machine problem is W[1]-hard with respect to this parameter, even if all processing times on the second machine are of unit length, while the problem is in XP when parameterized by the number of machines combined with the number of different due dates. We then move on to study the tractability of the problem when combining the number of different due dates with either the number of different weights or the number of different processing times on the first machine. We prove that in both cases the problem is fixed-parameter tractable for the two-machine case and is W[1]-hard for three or more machines.

Keywords: Scheduling; Flow-shop; Just-in-time; Parameterized complexity; Fixed-parameter tractability (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-019-00617-7 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:jsched:v:22:y:2019:i:6:d:10.1007_s10951-019-00617-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-019-00617-7

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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