The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine

The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine

0.00 Avg rating0 Votes
Article ID: iaor20002061
Country: United Kingdom
Volume: 26
Issue: 7
Start Page Number: 695
End Page Number: 698
Publication Date: Jun 1999
Journal: Computers and Operations Research
Authors:
Keywords: combinatorial analysis, heuristics
Abstract:

The problem of interest is to schedule two types of jobs on a two-stage flowshop with a common second-stage machine so as to minimize the makespan. This problem was previously known to be NP-hard in the ordinary sense. In this note, we give a proof for the strong NP-hardness.

Reviews

Required fields are marked *. Your email address will not be published.