Flowshop scheduling with interstage job transportation

DOI10.1007/S10951-014-0409-6zbMATH Open1328.90064OpenAlexW2003039485MaRDI QIDQ892841FDOQ892841

Wei-ya Zhong, Zhi-Long Chen

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

Recommendations

• Hybrid flowshop scheduling with interstage job transportation
• Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
• Complexity of flow shop scheduling problems with transportation constraints
• A two-stage flow shop scheduling problem with transportation considerations
• Machine scheduling with transportation considerations

zbMATH Keywords

approximation algorithmtransportationflowshop scheduling

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• An improved two-machine flowshop scheduling with intermediate transportation
• A note on the complexity of flow shop scheduling with transportation constraints
• Machine scheduling with transportation considerations
• Scheduling in manufacturing with transportation: classification and solution techniques
• Title not available (Why is that?)
• Cooperative game theory based coordinated scheduling of two-machine flow-shop and transportation
• Complexity of flow shop scheduling problems with transportation constraints
• Scheduling Parts in a Combined Production-transportation Work Cell
• Flow shop scheduling problems with transportation constraints revisited
• Flow shop scheduling problems with transportation constraints revisited
• Title not available (Why is that?)
• Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892841)