Re-entrant flowshop scheduling with learning considerations to minimize the makespan
From MaRDI portal
(Redirected from Publication:1787748)
Recommendations
- Heuristic algorithms for two machine re-entrant flow shop
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Minimizing makespan on a two-machine re-entrant flowshop
- A makespan study of the two-machine flowshop scheduling problem with a learning effect
- Minimizing makespan in re-entrant permutation flow-shops
Cites work
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- scientific article; zbMATH DE number 3786461 (Why is no real title available?)
- A bi-criterion single-machine scheduling problem with learning considerations
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A simulation-based scheduler for flexible flowlines
- A state-of-the-art review on scheduling with learning effects
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub
- Minimizing Makespan in a Class of Reentrant Shops
- Minimizing makespan in re-entrant permutation flow-shops
- Note on a single-machine scheduling problem with sum of processing times based learning and ready times
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- Optimal two- and three-stage production schedules with set-up time included
- Optimization by simulated annealing
- Scheduling problems with learning and ageing effects: a survey
- Single machine scheduling with learning effect considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling problems with a learning effect matrix
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Single-machine scheduling with learning considerations
- Some scheduling problems with general position-dependent and time-dependent learning effects
- The two-machine total completion time flow shop problem
Cited in
(3)- A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms
- Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm
- An iterated local search for a re-entrant flow shop scheduling problem
This page was built for publication: Re-entrant flowshop scheduling with learning considerations to minimize the makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787748)
