Batch-scheduling problems through the flowshop with both receiving and delivery just in time
Authors:
- 1 August 1993
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 31 (8) , 1943-1955
Abstract
In scheduling literature, the flowshop problem is usually concerned only with finding a processing order of jobs on each machine. However, this paper addresses flowshop batch-scheduling problems, that is, to determine batch sizes of parts with a common due date, and to schedule the resulting batches. We propose an objective for the problems that not only minimizes inventory but also provides for receiving material just in time and delivery just in time. A heuristic method to solve the problem is proposed. An example is also provided to show how the proposed method works.Keywords
This publication has 7 references indexed in Scilit:
- Flowshop scheduling with set-up, processing and removal times separatedInternational Journal of Production Research, 1991
- Design of a scheduling system for flexible manufacturing cells†International Journal of Production Research, 1990
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost FunctionsJournal of the Operational Research Society, 1990
- Heuristic algorithms for continuous flow-shop problemNaval Research Logistics (NRL), 1990
- Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-timeJournal of the Operational Research Society, 1989
- Batching to Minimize Flow Times on Parallel Heterogeneous MachinesManagement Science, 1989
- Batching to Minimize Flow Times on One MachineManagement Science, 1987