Scheduling in network flow shops

DOI10.1007/BF00121676zbMath0870.90066MaRDI QIDQ2564878

Reza H. Ahmadi

Publication date: 7 January 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

error boundsmakespanheuristicroutingcycle timestatic schedulingaverage flow timenetwork flow shop

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• A survey of results for sequencing problems with controllable processing times
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• The complexity of scheduling jobs in repetitive manufacturing systems
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Focused Scheduling in Proportionate Flowshops
• A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
• Cyclic Schedules for Job Shops with Identical Jobs
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Improved Approximation Algorithms for Shop Scheduling Problems
• An Algorithm for the Open-Shop Problem
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Scheduling in network flow shops