Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
From MaRDI portal
Publication:336439
DOI10.1016/J.COR.2013.02.024zbMATH Open1348.90306OpenAlexW1989469885MaRDI QIDQ336439FDOQ336439
Authors: Agnieszka Rudek, Radosław Rudek 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.024
Recommendations
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
- Scheduling problems with position dependent job processing times: computational complexity results
- Flow shop scheduling jobs with position-dependent processing times
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Flowshop scheduling problems with a position-dependent exponential learning effect
Cites Work
- Title not available (Why is that?)
- Optimization by simulated annealing
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- Monotonic Convergence of Iterative Learning Control for Uncertain Systems Using a Time-Varying Filter
- A genetic algorithm for flowshop sequencing
- Time-dependent scheduling
- A state-of-the-art review on scheduling with learning effects
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Flowshop scheduling research after five decades
- Some efficient heuristic methods for the flow shop sequencing problem
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
- Single machine scheduling with learning effect considerations
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- The single-machine total weighted tardiness scheduling problem with position-based learning effects
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- A new approach to the learning effect: Beyond the learning curve restrictions
- A makespan study of the two-machine flowshop scheduling problem with a learning effect
- 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
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
Cited In (13)
- A local search algorithm for the flow shop scheduling problem with release dates
- Minimizing makespan in an ordered flow shop with machine-dependent processing times
- A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects
- Makespan minimization in job shops: a polynomial time approximation scheme
- Flow shop scheduling problem with position-dependent processing times
- Approximation algorithms for some position-dependent scheduling problems
- Two-agent scheduling problems with the general position-dependent processing time
- Title not available (Why is that?)
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
- Flow shop scheduling jobs with position-dependent processing times
- Scheduling problems with position dependent job processing times: computational complexity results
- A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
Uses Software
This page was built for publication: Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336439)
