Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
From MaRDI portal
Publication:6094568
Recommendations
- Single-Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- On optimal due date assignment without restriction and resource allocation in group technology scheduling
- Common due-window assignment and group scheduling with position-dependent processing times
- Single machine scheduling problem with multiple due windows assignment in a group technology
Cites work
- A Due-Window Determination In Minmax Scheduling Problems
- A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
- A common due-data assignment problem on parallel identical machines
- A note: minmax due-date assignment problem with lead-time cost
- A survey of scheduling with controllable processing times
- A survey on scheduling problems with due windows
- Common due-window assignment and group scheduling with position-dependent processing times
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- Minmax due-date assignment with a time window for acceptable lead-times
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- Minmax scheduling problems with a common due-window
- Minmax scheduling problems with common due-date and completion time penalty
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Scheduling with a common due-window: polynomially solvable cases
- Single machine due window assignment resource allocation scheduling with job-dependent learning effect
- Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times
- Single-machine group scheduling with deteriorating jobs and allotted resource
- Single-machine group scheduling with processing times dependent on position, starting time and allotted resource
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
Cited in
(10)- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Scheduling with multiple common due windows assignment and general position-dependent and resource-dependent processing times
- A note: minmax due-window assignment with fixed earliness-tardiness costs
- Common due-window assignment and group scheduling with position-dependent processing times
- A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect
- Single machine scheduling problem with multiple due windows assignment in a group technology
- Single-Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties
- Minmax scheduling problems with a common due-window
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- On optimal due date assignment without restriction and resource allocation in group technology scheduling
This page was built for publication: Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094568)