Re-entrant flowshop scheduling with learning considerations to minimize the makespan
From MaRDI portal
Publication:1787748
DOI10.1007/S40995-017-0236-7zbMATH Open1397.90196OpenAlexW2596156679MaRDI QIDQ1787748FDOQ1787748
Authors: Chin-Chia Wu, Shang-Chia Liu, Yu Cheng, Shi-Yuan Liu, Win-Chin Lin, T. C. Edwin Cheng 
Publication date: 5 October 2018
Published in: Iranian Journal of Science and Technology, Transactions A: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40995-017-0236-7
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
- Optimization by simulated annealing
- Optimal two- and three-stage production schedules with set-up time included
- The two-machine total completion time flow shop problem
- A state-of-the-art review on scheduling with learning effects
- Title not available (Why is that?)
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub
- Single-machine scheduling with learning considerations
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- Single machine scheduling with learning effect considerations
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Scheduling problems with learning and ageing effects: a survey
- Minimizing makespan in re-entrant permutation flow-shops
- A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
- Single-machine and two-machine flowshop scheduling with general learning functions
- 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
- Title not available (Why is that?)
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Minimizing Makespan in a Class of Reentrant Shops
- Note on a single-machine scheduling problem with sum of processing times based learning and ready times
- Single-machine scheduling problems with a learning effect matrix
- A simulation-based scheduler for flexible flowlines
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)
