Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
From MaRDI portal
Publication:2688577
DOI10.3934/mbe.2022414OpenAlexW4285297534MaRDI QIDQ2688577
Xue Jia, Jing Xue, Ji-Bo Wang, Shi-Yun Wang
Publication date: 3 March 2023
Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mbe.2022414
Cites Work
- Single-machine scheduling with two competing agents and learning consideration
- Models and algorithms of time-dependent scheduling
- Due-window assignment scheduling in the proportionate flow shop setting
- Minmax scheduling problems with a common due-window
- Scheduling jobs under decreasing linear deterioration
- Complexity of scheduling tasks with time-dependent execution times
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- Due date assignment scheduling with positional-dependent weights and proportional setup times
- Due-window assignment scheduling with past-sequence-dependent setup times
- Parallel-batch scheduling with deterioration and rejection on a single machine
- Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
- Due date-related scheduling with two agents. Models and algorithms
- Bicriterion scheduling with group technology and deterioration effect
- Minmax scheduling problems with common due-date and completion time penalty
- Minmax due-date assignment with a time window for acceptable lead-times
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Resource allocation flowshop scheduling with learning effect and slack due window assignment
- Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects
- Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology
- Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects
- A Due-Window Determination In Minmax Scheduling Problems
- A common due-data assignment problem on parallel identical machines
- Bicriterion scheduling with truncated learning effects and convex controllable processing times
This page was built for publication: Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
