A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
From MaRDI portal
Publication:5935393
DOI10.1016/S0377-2217(00)00105-3zbMath0994.90074OpenAlexW2035857042MaRDI QIDQ5935393
Chandrasekharan Rajendran, Hans Ziegler
Publication date: 26 June 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00105-3
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing ⋮ Scheduling in cellular manufacturing systems: an heuristic approach ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
Cites Work
- Unnamed Item
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A survey of priority rule-based scheduling
- A new heuristic method for the flow shop sequencing problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Flowshop sequencing with mean flowtime objective
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A tabu search approach for the flow shop scheduling problem
- Optimal two- and three-stage production schedules with setup times included
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- An Evaluation of Flow Shop Sequencing Heuristics
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- The Complexity of Flowshop and Jobshop Scheduling
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
