Two‐machine flowshop scheduling with conditional deteriorating second operations

doi:10.1111/j.1475-3995.2006.00536.x

Two‐machine flowshop scheduling with conditional deteriorating second operations

2006-03-09

0

PRE

AI

DOI：10.1111/j.1475-3995.2006.00536.x

原文链接

原文求助

摘要

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.

Two‐machine flowshop scheduling with conditional deteriorating second operations

摘要

AI总结

期刊

机构

引用论文