No-wait or no-idle permutation flowshop scheduling with dominating machines |
| |
Authors: | Ji-Bo Wang Zun-Quan Xia |
| |
Institution: | 1. Department of Applied Mathematics, Dalian University of Technology, 116024, Dalian, P. R. China
|
| |
Abstract: | In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|