Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
From MaRDI portal
Publication:425519
DOI10.1016/J.INS.2011.08.018zbMATH Open1239.90050OpenAlexW2020049463MaRDI QIDQ425519FDOQ425519
Authors: Wen-Hung Kuo, Chou-Jung Hsu, Dar-Li Yang 
Publication date: 8 June 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.08.018
Recommendations
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- Flow-shop scheduling with a learning effect
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Flowshop scheduling with a general exponential learning effect
- Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal two- and three-stage production schedules with set-up time included
- A state-of-the-art review on scheduling with learning effects
- Single-machine scheduling with learning considerations
- Scheduling with general job-dependent learning curves.
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Some results of the worst-case analysis for flow shop scheduling
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A new approach to the learning effect: Beyond the learning curve restrictions
- Single-machine group scheduling with a time-dependent learning effect
- Single-machine scheduling problems with the time-dependent learning effect
- Flow-shop scheduling with a learning effect
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Scheduling problems with general effects of deterioration and learning
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
- A bi-criterion single-machine scheduling problem with learning considerations
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Complexity results for single-machine scheduling with positional learning effects
- Flow-shops with a dominant machine
- The learning effect: getting to the core of the problem
- Flow shop scheduling jobs with position-dependent processing times
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- Note on ``Single-machine and flowshop scheduling with a general learning effect model and ``Some single-machine and m-machine flowshop scheduling problems with learning considerations
Cited In (19)
- Coordinated \textit{seru} scheduling and distribution operation problems with DeJong's learning effects
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Bicriterion optimization for flow shop with a learning effect subject to release dates
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- Four single-machine scheduling problems involving due date determination decisions
- Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
- Scheduling with job-splitting considering learning and the vital-few law
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- Flowshop scheduling with a general exponential learning effect
- Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
- Flowshop scheduling problems with a position-dependent exponential learning effect
- Scheduling with a position-weighted learning effect and job release dates
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- Research on m‐machine flow shop scheduling with truncated learning effects
- A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
This page was built for publication: Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425519)
