Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration

DOI10.1016/j.cor.2015.05.010zbMath1349.90369OpenAlexW1460538605MaRDI QIDQ342119

Xiuping Guo, De-ming Lei

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.05.010

zbMATH Keywords

local searchcontrolled deteriorationhybrid flow shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Patient scheduling with deteriorating treatment duration and maintenance activity

Cites Work

• Unnamed Item
• A heuristic method for two-stage hybrid flow shop with dedicated machines
• A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
• The optimal number of used machines in a two-stage flexible flowshop scheduling problem
• Minimizing the number of machines for scheduling jobs with equal processing times
• Minimizing the number of machines for minimum length schedules
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• The hybrid flow shop scheduling problem
• A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages

This page was built for publication: Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration