Interfering Job Set Scheduling on Two-Operation Three-Machine Flowshop
This paper considers three machine flowshop scheduling problem with two agents. The jobs of first agent have two operations executed in the same order, on M 1 and then on M 2 respectively. According to the second agent, the jobs should be executed on M 2 and then on M 3 . Thus, the second machine M...
Uloženo v:
| Vydáno v: | 2009 IEEE-RIVF International Conference on Computing and Communication Technologies s. 1 - 5 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.07.2009
|
| Témata: | |
| ISBN: | 9781424445660, 1424445663 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This paper considers three machine flowshop scheduling problem with two agents. The jobs of first agent have two operations executed in the same order, on M 1 and then on M 2 respectively. According to the second agent, the jobs should be executed on M 2 and then on M 3 . Thus, the second machine M 2 has to be shared to perform all of jobs. The objective is to minimize at the same time the makespan of each job set. The epsiv-constraint approach is utilized, i.e. the maximum completion time of the one agent has to be minimized while the maximum completion time of the other is bounded. This scheduling problem was proved as binary NP-hard. In this study, a pseudo-polynomial algorithm is proposed. |
|---|---|
| ISBN: | 9781424445660 1424445663 |
| DOI: | 10.1109/RIVF.2009.5174646 |