.png){kind=icon}
Return
Two‐machine flowshop scheduling with conditional deteriorating second operations
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2006.00536.x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
AbstractThis paper considers a flowshop‐scheduling problem with a waiting time constraint imposed to restrict the processing of the two operations of each job. If the second operation of a job cannot start within a specified waiting time after the completion of its first operation, then an extra processing time will be incurred for its second operation as a penalty. We first show that even a greatly restricted version of the problem is strongly 𝒩𝒫‐hard. We then develop an O(n2) algorithm to determine the makespan of a processing sequence of the jobs.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available