An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
From MaRDI portal
(Redirected from Publication:2195404)
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
Cites work
- A bi-criterion single-machine scheduling problem with learning considerations
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A note on scheduling problems with learning effect and deteriorating jobs
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A survey of scheduling problems with no-wait in process
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates
- Flowshop scheduling with a general exponential learning effect
- Heuristic for no-wait flow shops with makespan minimization
- Learning and forgetting effects on a group scheduling problem
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
- No-wait shop scheduling: Computational complexity and approximate algorithms
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Several flow shop scheduling problems with truncated position-based learning effect
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine scheduling with learning considerations
Cited in
(12)- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine
- Solving permutation flow shop scheduling problem with sequence-independent setup time
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
- Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
- Solving the permutation flow shop scheduling problem with sequence-dependent setup time via iterative greedy algorithm and imitation learning
- The fourth comprehensive review of scheduling problems with setup times
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)
