Scheduling a two-machine flowshop with travel times to minimize maximum lateness

DOI10.1080/002075497195948zbMath0940.90509OpenAlexW2149033798MaRDI QIDQ4245165

James W. Stevens, Douglas D. Gemmill

Publication date: 19 July 2000

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075497195948

Mathematics Subject Classification ID

Operations research and management science (90B99)

Related Items (6)

Machine scheduling with job delivery coordination ⋮ A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks ⋮ Machine scheduling with transportation considerations ⋮ Machine scheduling with deliveries to multiple customer locations ⋮ Approximation solutions for the cutting stock `portfolio' problem ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time

This page was built for publication: Scheduling a two-machine flowshop with travel times to minimize maximum lateness