This paper considers the no-wait scheduling of n jobs in a two-machine flow shop, where some jobs require processing on the first machine only. The objective is to minimize the maximum completion time, or makespan. In view of its NP-hardness, we propose ...
This paper is a note on "Complexity analysis of job-shop scheduling with deteriorating jobs" G. Mosheiov, Complexity analysis of job-shop scheduling with deteriorating jobs, Discrete Applied Mathematics 117 (2002) 195-209]. A proportional deterioration ...
We consider flow shop scheduling problems with two distinct job due dates. Motivated by the NP-hardness of these problems with arbitrary job processing times, we focus on their solvability with ordered or proportionate job processing ...
INFORMS
Linthicum, MD, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in