Maximizing the weighted number of just-in-time jobs in flow shop scheduling

Authors:
Byung-Cheon Choi;Suk-Hun Yoon
Affiliations:
Department of Industrial Engineering, Seoul National University, Seoul, South Korea;Department of Industrial and Information Systems Engineering, Soongsil University, Seoul, South Korea 156-743
Venue:
Journal of Scheduling
Year:
2007

Citing 5
Cited 3

Introduction to algorithms

Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

Computers and Operations Research
Minimizing the weighted number of tardy jobs on a two-machine flow shop

Computers and Operations Research
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)

Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems

Journal of Scheduling
An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem

Journal of Scheduling
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.