Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
From MaRDI portal
Publication:763108
DOI10.1007/s10479-011-0923-2zbMath1233.90174OpenAlexW2069241277MaRDI QIDQ763108
Publication date: 9 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0923-2
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (28)
Due-window assignment scheduling in the proportionate flow shop setting ⋮ Scheduling identical jobs on uniform parallel machines under position-based learning effects ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ Scheduling with a position-weighted learning effect and job release dates ⋮ An assignment-based lower bound for a class of two-machine flow shop problems ⋮ Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms ⋮ Several flow shop scheduling problems with truncated position-based learning effect ⋮ Flowshop scheduling with a general exponential learning effect ⋮ A note on ``Single-machine scheduling problems with both deteriorating jobs and learning effects ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Strong NP-hardness of scheduling problems with learning or aging effect ⋮ Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects ⋮ Several single-machine scheduling problems with general learning effects ⋮ Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times ⋮ Scheduling jobs with truncated exponential learning functions ⋮ Single-machine group scheduling with general deterioration and learning effects ⋮ Optimal due-date assignment problem with learning effect and resource-dependent processing times ⋮ Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time ⋮ Single machine scheduling with exponential learning functions ⋮ 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 ⋮ Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times ⋮ Scheduling problems with position dependent job processing times: computational complexity results ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ Single-machine scheduling problems with a learning effect matrix ⋮ Improved algorithms for proportionate flow shop scheduling with due-window assignment ⋮ A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
Cites Work
- Unnamed Item
- Unnamed Item
- A revision of machine scheduling problems with a general learning effect
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- A bicriteria parallel machine scheduling with a learning effect of setup and removal times
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling problems with a learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- Some results of the worst-case analysis for flow shop scheduling
- Scheduling with general job-dependent learning curves.
- A bi-criterion single-machine scheduling problem with learning considerations
- Flow shop scheduling jobs with position-dependent processing times
- Minimizing total tardiness in a scheduling problem with a learning effect
- A state-of-the-art review on scheduling with learning effects
- A new approach to the learning effect: Beyond the learning curve restrictions
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
- Optimal two- and three-stage production schedules with setup times included
- Flow-shop scheduling with a learning effect
- A due-window assignment problem with position-dependent processing times
- Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
This page was built for publication: Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
