Flowshop scheduling with interstage job transportation

DOI10.1007/S10951-014-0409-6zbMath1328.90064OpenAlexW2003039485MaRDI QIDQ892841

Zhi-Long Chen, Wei-ya Zhong

Publication date: 12 November 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0409-6

zbMATH Keywords

transportationapproximation algorithmflowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Flow shop scheduling problems with transportation constraints revisited ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
• Scheduling a hybrid flowshop with batch production at the last stage
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
• The hybrid flow shop scheduling problem
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Optimal two- and three-stage production schedules with setup times included
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Scheduling of a Two-machine Flowshop with Travel Time Between Machines
• Scheduling Parts in a Combined Production-transportation Work Cell
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
• Algorithms and Computation
• Bounds for Certain Multiprocessing Anomalies
• Machine scheduling with transportation considerations
• Makespan minimization for flow-shop problems with transportation times and a single robot

This page was built for publication: Flowshop scheduling with interstage job transportation