On the parameterized tractability of the just-in-time flow-shop scheduling problem
- 10 Downloads
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-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-hard for three or more machines.
KeywordsScheduling Flow-shop Just-in-time Parameterized complexity Fixed-parameter tractability
This research was partially supported by Grant No. 2016049 from the United States-Israel Binational Science Foundation (BSF). The first author’s work was supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA Grant 631163.11, and by the Israel Science Foundation (Grant 551145/14). We would also like to thank the reviewers for their insightful comments on this paper, comments which improved the paper dramatically.
- Downey, R.G., & Fellows, M.R. (1992). Fixed-parameter intractability. In Proceedings of the 7th annual structure in complexity theory conference (COCO ’92) (pp. 36–49).Google Scholar
- Flum, J., & Grohe, M. (1998). Parameterized complexity theory. New York: Springer.Google Scholar
- Hermelin, D., Kubitza, J.M., Shabtay, D., Talmon, N., & Woeginger, G. (2015). Scheduling two competing agents when one agent has significantly fewer jobs. In Proceedings of the 10th international symposium on parameterized and exact computation (IPEC ’15).Google Scholar
- Shabtay, D., & Steiner, G. (2012). Scheduling to maximize the number of just-in-time jobs: A survey. In R. Z. Rios-Mercado & Y. A. Rios-Solis (Eds.), Just-In-Time systems. New York: Springer.Google Scholar