Solving hybrid flow shop problem using energetic reasoning and global operations
- 31 December 2001
- Vol. 29 (6), 501-511
- https://doi.org/10.1016/s0305-0483(01)00040-8
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Scheduling flow-shops with parallel machines and finite in-process buffers by multilevel programmingPublished by Springer Nature ,2006
- Branch and bound crossed with GA to solve hybrid flowshopsEuropean Journal of Operational Research, 1998
- Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi/Cmax scheduling problemAnnals of Operations Research, 1998
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hardEuropean Journal of Operational Research, 1996
- Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespanInternational Journal of Production Economics, 1992
- Branch and bound algorithm for the flow shop with multiple processorsEuropean Journal of Operational Research, 1991
- Scheduling a flexible machining centreEngineering Costs and Production Economics, 1990
- Two-Stage, Hybrid Flowshop Scheduling ProblemJournal of the Operational Research Society, 1988
- A Solution to a Special Class of Flow Shop Scheduling ProblemsPublished by Springer Nature ,1973
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954