An iterative neighborhood search algorithm for large scale no-wait flow-shop

MaRDI QIDQ2885871zbMATH OpenFDO

Authors Cunli Song, Xiaobing Liu, Wei Wang

Publication date 1 June 2012

Published in Control and Decision (Search for Journal in Brave)

zbMATH Keywords

makespaniterative neighborhood search algorithmno-wait flow-shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Production models (90B30) Stochastic scheduling theory in operations research (90B36)

Recommendations

• An iterated local search algorithm for the lot-streaming flow shop scheduling problem
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
• An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
• An iterated local search for a re-entrant flow shop scheduling problem
• Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

Cited in

(1)

• A survey of scheduling problems with no-wait in process

This page was built for publication: An iterative neighborhood search algorithm for large scale no-wait flow-shop

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