Name
Title | ||
|---|---|---|
Scheduling and dispatching: scheduling batch processing machines in complex job shops |
Abstract | ||
|---|---|---|
This paper considers a complex job shop problem with reentrant flow and batch processing machines. A modified shifting bottleneck heuristic (MSB) is considered for generating machine schedules to minimize the total weighted tardiness. We observe that the MSB could produce infeasible schedules where cyclic schedules are found. A cycle elimination procedure is proposed to remove the possibility of the MSB generating cyclic schedules in the solution. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1145/564124.564297 | Winter Simulation Conference |
Keywords | Field | DocType |
complex job shop problem,batch processing machine,cyclic schedule,total weighted tardiness,cycle elimination procedure,reentrant flow,infeasible schedule,bottleneck heuristic,machine schedule,msb generating cyclic schedule,batch process | Mathematical optimization,Tardiness,Simulation,Scheduling (computing),Computer science,Shifting bottleneck heuristic,Flow shop scheduling,Job shop,Schedule,Batch processing,Distributed computing,Reentrancy | Conference |
ISBN | Citations | PageRank |
0-7803-7309-X | 0 | 0.34 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kasin Oey | 1 | 0 | 0.34 |
| Scott J. Mason | 2 | 555 | 73.37 |