Nonpreemptive flowshop scheduling with machine dominance |
| |
| Institution: | 1. Department of Theoretical Informatics and Mathematical Logic, School of Mathematics and Physics, Charles University, Malostranské nám 25, 118 00 Prague 1, Czech Republic;2. JAIST, 1-1 Asahidai, Tatsunokuchi, Ishikawa 923-12, Japan;1. TU Berlin, Faculty IV, Algorithmics and Computational Complexity, Berlin, Germany;2. THM, University of Applied Sciences Mittelhessen, Giessen, Germany;1. Royal Holloway College, University of London, United Kingdom;2. Max Planck Institute for Research on Collective Goods, Bonn, Germany;1. Department of Mathematics, COMSATS Institute of Information Technology, Sahiwal Campus, Pakistan;2. Erasmus University Rotterdam, Faculty of Philosophy, Burgemeester Oudlaan 50, 3062 PA, The Netherlands |
| |
| Abstract: | Flowshop scheduling deals with processing a set of jobs through a set of machines, where all jobs have to pass among machines in the same order. With the exception of minimizing a makespan on two machines, almost all other flowshop problems in a general setup are known to be computationally intractable. In this paper we study special cases of flowshop defined by additional machine dominance constraints. These constraints impose certain relations among the job processing times on different machines and make the studied problems tractable. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
