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.086zbMATH Open1329.90068OpenAlexW2084905630MaRDI QIDQ905364FDOQ905364
Authors: Radosław Rudek 
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
Recommendations
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Scheduling problems with position dependent job processing times: computational complexity results
- Flow shop scheduling jobs with position-dependent processing times
- Two-agent scheduling problems with the general position-dependent processing time
- Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- 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
- Flowshop scheduling research after five decades
- Title not available (Why is that?)
- A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time
- Single-machine group scheduling problems with deteriorated and learning effect
- Single-machine scheduling with learning considerations
- 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
- Parallel machine scheduling with a learning effect
- Single machine scheduling with learning effect considerations
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Single-machine scheduling problems with the time-dependent learning effect
- Self-improving algorithms
- A makespan study of the two-machine flowshop scheduling problem with a learning effect
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Flow-shop scheduling with a learning effect
- On single processor scheduling problems with learning dependent on the number of processed jobs
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- Flowshop and Jobshop Schedules: Complexity and Approximation
- 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
- Scheduling problems with general effects of deterioration and learning
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Single machine multiple common due dates scheduling with learning effects
- Scheduling with deteriorating jobs and learning effects
- Scheduling jobs under an aging effect
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function
- The transition from stagnation to growth: An adaptive learning approach
- Translations of service level agreement in systems based on service-oriented architectures
- A Theory of the Learning Process
Cited In (4)
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Multitasking scheduling problems with deterioration effect
- Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
This page was built for publication: The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905364)
