An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
DOI10.1016/J.INS.2018.04.038zbMATH Open1440.90010OpenAlexW2797947746WikidataQ129990955 ScholiaQ129990955MaRDI QIDQ2195404FDOQ2195404
Authors: Xiaoping Li, Zhi Yang, Rubén Ruiz, Tian Chen, Shaochun Sui 
Publication date: 8 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/141944
Recommendations
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Learning and forgetting effects on a group scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Learning and forgetting effects on a group scheduling problem
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine scheduling with learning considerations
- Flowshop scheduling with a general exponential learning effect
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Several flow shop scheduling problems with truncated position-based learning effect
- A bi-criterion single-machine scheduling problem with learning considerations
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- A note on scheduling problems with learning effect and deteriorating jobs
- No-wait shop scheduling: Computational complexity and approximate algorithms
- Heuristic for no-wait flow shops with makespan minimization
- Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates
- A survey of scheduling problems with no-wait in process
Cited In (10)
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- Solving permutation flow shop scheduling problem with sequence-independent setup time
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
- Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
This page was built for publication: An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195404)
