Name
Abstract | ||
|---|---|---|
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 M1 and then on M2 respectively. According to the second agent, the jobs should be executed on M2 and then on M3. Thus, the second machine M2 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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/RIVF.2009.5174646 | RIVF |
Keywords | Field | DocType |
optimisation,epsiv-constraint approach,two-operation three-machine flowshop,constraint theory,machine flowshop scheduling problem,computational complexity,pseudo-polynomial algorithm,binary np-hard problem,flow shop scheduling,maximum completion time,polynomials,job set scheduling,data mining,scheduling algorithm,scheduling problem,schedules | Mathematical optimization,Single-machine scheduling,Job shop scheduling,Scheduling (computing),Flow shop scheduling,Schedule,Mathematics,Computational complexity theory,Bounded function,Binary number | Conference |
ISBN | Citations | PageRank |
978-1-4244-4568-4 | 3 | 0.39 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nguyen Huynh Tuong | 1 | 51 | 4.60 |
| Ameur Soukhal | 2 | 119 | 10.15 |