The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
From MaRDI portal
Publication:905364
DOI10.1016/j.amc.2013.06.086zbMath1329.90068OpenAlexW2084905630MaRDI QIDQ905364
Publication date: 19 January 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.06.086
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ Multitasking scheduling problems with deterioration effect
Cites Work
- Unnamed Item
- Unnamed Item
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- On single processor scheduling problems with learning dependent on the number of processed jobs
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- Single machine multiple common due dates scheduling with learning effects
- Scheduling problems with general effects of deterioration and learning
- Scheduling with deteriorating jobs and learning effects
- A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Single-machine group scheduling problems with deteriorated and learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- The transition from stagnation to growth: An adaptive learning approach
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A concise survey of scheduling with time-dependent processing times
- Scheduling problems with position dependent job processing times: computational complexity results
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A state-of-the-art review on scheduling with learning effects
- Single-machine scheduling problems with the time-dependent learning effect
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- TRANSLATIONS OF SERVICE LEVEL AGREEMENT IN SYSTEMS BASED ON SERVICE-ORIENTED ARCHITECTURES
- Self-Improving Algorithms
- A makespan study of the two-machine flowshop scheduling problem with a learning effect
- Flow-shop scheduling with a learning effect
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- A Theory of the Learning Process
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs under an aging effect
- Single machine scheduling with learning effect considerations
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
This page was built for publication: The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
