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.024zbMath1348.90306OpenAlexW1989469885MaRDI QIDQ336439
Radosław Rudek, Agnieszka 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
Related Items (7)
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 ⋮ Approximation algorithms for some position-dependent scheduling problems ⋮ A local search algorithm for the flow shop scheduling problem with release dates ⋮ Two-agent scheduling problems with the general position-dependent processing time ⋮ A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects ⋮ A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- On single processor scheduling problems with learning dependent on the number of processed jobs
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- 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
- Some efficient heuristic methods for the flow shop sequencing problem
- Time-dependent scheduling
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- A genetic algorithm for flowshop sequencing
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- The single-machine total weighted tardiness scheduling problem with position-based learning effects
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
- 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 state-of-the-art review on scheduling with learning effects
- An improved NEH heuristic to minimize makespan in permutation flow shops
- A new approach to the learning effect: Beyond the learning curve restrictions
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- 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
- Monotonic Convergence of Iterative Learning Control for Uncertain Systems Using a Time-Varying Filter
- Single machine scheduling with learning effect considerations
This page was built for publication: Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
