Sequency on two and three machines with setup, processing and removal times separated

1 September 1983

journal article
research article
Published by Taylor & Francis in International Journal of Production Research

Vol. 21 (5) , 723-732
https://doi.org/10.1080/00207548308942406

Abstract

n jobs are to be processed on two or three machines. Each job must be processed in sequence, first on machine I than on machine II, etc. For each job, setup time, processing time, and removal time is known in each machine. Algorithms are developed which determine an optimal sequence that minimizes the total elapsed time. Numerical examples illustrate the algorithms.

Keywords

This publication has 5 references indexed in Scilit:

Optimal Two-Stage Production Scheduling with Setup Times Separated
A I I E Transactions, 1979
Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
Operations Research, 1977
Mathematical aspects of the 3 × n job‐shop sequencing problem
Naval Research Logistics Quarterly, 1974
Sequencing n Jobs on Two Machines with Arbitrary Time Lags
Management Science, 1959
Optimal two‐ and three‐stage production schedules with setup times included
Naval Research Logistics Quarterly, 1954