Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
From MaRDI portal
Publication:6094568
DOI10.1080/0305215x.2021.1961761zbMath1523.90193OpenAlexW3195601797MaRDI QIDQ6094568
No author found.
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2021.1961761
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- A note: minmax due-date assignment problem with lead-time cost
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Minmax scheduling problems with a common due-window
- Single-machine group scheduling with processing times dependent on position, starting time and allotted resource
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Single machine due window assignment resource allocation scheduling with job-dependent learning effect
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- Scheduling with a common due-window: polynomially solvable cases
- A survey of scheduling with controllable processing times
- Minmax scheduling problems with common due-date and completion time penalty
- Single-machine group scheduling with deteriorating jobs and allotted resource
- Minmax due-date assignment with a time window for acceptable lead-times
- A survey on scheduling problems with due windows
- Common Due-Window Assignment and Group Scheduling with Position-Dependent Processing Times
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- A Due-Window Determination In Minmax Scheduling Problems
- A common due-data assignment problem on parallel identical machines
This page was built for publication: Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
