Makespan distribution of permutation flowshop schedules
From MaRDI portal
Publication:835630
DOI10.1007/s10951-008-0071-yzbMath1168.90446OpenAlexW2074288796MaRDI QIDQ835630
Feng Jin, Jatinder N. D. Gupta, Cheng Wu, Shi-ji Song
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0071-y
job-dominated and machine-dominated PFSPsmakespan distributionpermutation flowshop scheduling problem (PFSP)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Some efficient heuristic methods for the flow shop sequencing problem
- Analysis of the left tail for the makespan distribution in flow-shop problems
- A fast tabu search algorithm for the permutation flow-shop problem
- Benchmarks for basic scheduling problems
- Sequencing theory
- Some aspects of scatter search in the flow-shop problem
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Flowshop-scheduling problems with makespan criterion: a review
- Contributions to the Theory of Markov Chains. II
This page was built for publication: Makespan distribution of permutation flowshop schedules
