Job Shop Scheduling with Transfer Batches

Kapitola, resp. kapitoly v odborné knize

en

This paper presents a job shop scheduling problem where each job (production batch) can be split into multiple equal-sized transfer batches which can be moved to the next operation immediately after their completion on the current operation. The start times of transfer batches need not be consider as decision variables and their values can be derived from start and completion times of operations on production batches. The presented approach uses a disjunctive graph model, whose size and structure is the same as in the case of the classical job shop problem, and modified Critical Path Method for computations in this graph. This approach can be integrated into any heuristic method for job shop scheduling which uses the disjunctive graph-based representation and the makespan objective.

2000-01-01

Physica-Verlag

Heidelberg

3-7908-1257-9

Robert John, Ralph Birkenhead (eds.) Soft Computing Techniques and Applications

105–

6