The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times

DOI10.1016/J.AMC.2013.06.086MaRDI QIDQ905364zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexitylearningagingschedulingflowshopdeteriorating

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Theory of the Learning Process
• A concise survey of scheduling with time-dependent processing times
• A makespan study of the two-machine flowshop scheduling problem with a learning effect
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time
• A state-of-the-art review on scheduling with learning effects
• Flow-shop scheduling with a learning effect
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Flowshop scheduling research after five decades
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
• Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
• Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
• On single processor scheduling problems with learning dependent on the number of processed jobs
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with a learning effect
• Scheduling jobs under an aging effect
• Scheduling problems with general effects of deterioration and learning
• Scheduling problems with position dependent job processing times: computational complexity results
• Scheduling with deteriorating jobs and learning effects
• Self-improving algorithms
• Single machine multiple common due dates scheduling with learning effects
• Single machine scheduling with learning effect considerations
• Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
• Single-machine group scheduling problems with deteriorated and learning effect
• Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
• Single-machine scheduling problems with the time-dependent learning effect
• Single-machine scheduling with learning considerations
• Some scheduling problems with general position-dependent and time-dependent learning effects
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
• Some single-machine and flowshop scheduling problems with a non-linear deterioration function
• The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
• The transition from stagnation to growth: An adaptive learning approach
• Translations of service level agreement in systems based on service-oriented architectures
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities

Cited in

(6)

• 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
• 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
• 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)