Scheduling in network flow shops

DOI10.1007/BF00121676MaRDI QIDQ2564878zbMATH OpenFDO

Authors Reza Ahmadi

Publication date 7 January 1997

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

zbMATH Keywords

error boundsheuristicmakespanroutingcycle timestatic schedulingaverage flow timenetwork flow shop

Mathematics Subject Classification ID

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

Recommendations

• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• A survey and evaluation of static flowshop scheduling heuristics
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• scientific article; zbMATH DE number 7722

Cites work

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

Cited in

(13)

• Sequencing and scheduling in flowshops with task redistribution
• A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
• scientific article; zbMATH DE number 776077 (Why is no real title available?)
• Analysis of linkage network of queues with a multi stage flowshop scheduling system
• scientific article; zbMATH DE number 1594553 (Why is no real title available?)
• Job-shop production scheduling with reverse flows
• SCHEDULING TWO SALESMEN IN A NETWORK
• Reversible-shop scheduling
• Scheduling problems over a network of machines
• scientific article; zbMATH DE number 15416 (Why is no real title available?)
• Integrated job scheduling and network routing
• Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem
• A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis

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

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