Abstract
In this paper we consider the maximization of the weighted number of just-in-time jobs that should be completed exactly on their due dates in n-job, m-machine flow shop problems. We show that a two-machine flow shop problem is NP-complete. When job weights are all identical, we show that the problem can be solved in polynomial time. We also show that a three-machine flow shop problem with identical job weights is NP-hard in the strong sense by reduction of the 3-partition problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bulfin, R. L., & M’Hallah, R. (2003). Minimizing the weighted number of tardy jobs on a two-machine flow shop. Computers and Operations Research, 30, 1887–1900.
Cepek, O., & Sung, S. C. (2005). A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers and Operations Research, 32, 3265–3271.
Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1996). Introduction to algorithms. Cambridge: MIT Press.
Dauzere-Peres, S., & Sevaux, M. (2003). Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Research Logistics, 50, 273–288.
Garey, M. R. & Johnson, D. S. (1979). Computers and intractability, a guide to the theory of NP-completeness. New York: Freeman.
Gavril, F. (1972). Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing, 1(2), 180–187.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326.
Hiraishi, K., Levner, E., & Vlach, M. (2002). Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Computers and Operations Research, 29, 841–848.
Jozefowska, J., Jurisch, B., & Kubiak, W. (1994). Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters, 16, 277–283.
Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller, & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85–103). New York: Plenum.
Lann, A., & Mosheiov, G. (1996). Single machine scheduling to minimize the number of early and tardy jobs. Computers and Operations Research, 23, 769–781.
M’Hallah, R., & Bulfin, R. L. (2003). Minimizing the weighted number of tardy jobs on a single machine. European Journal of Operational Research, 145, 45–56.
M’Hallah, R., & Bulfin, R. L. (2005). Minimizing the weighted number of tardy jobs on parallel processors. European Journal of Operational Research, 160, 471–484.
Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102–109.
Pinedo, M. (2002). Scheduling: theory, algorithm, and systems. Upper Saddle River: Prentice Hall.
Sevaux, M., & Dauzere-Peres, S. (2003). Genetic algorithm to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research, 151, 296–306.
van den Akker, M., & Hoogeveen, H. (2004). Minimizing the number of tardy jobs. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: Chapman and Hall/CRC.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Choi, BC., Yoon, SH. Maximizing the weighted number of just-in-time jobs in flow shop scheduling. J Sched 10, 237–243 (2007). https://doi.org/10.1007/s10951-007-0030-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-007-0030-z