Pages that link to "Item:Q1592755"
From MaRDI portal
The following pages link to Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755):
Displaying 21 items.
- Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251) (← links)
- On-line supply chain scheduling problems with preemption (Q872299) (← links)
- On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
- Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
- On-line integrated production-distribution scheduling problems with capacitated deliveries (Q1042489) (← links)
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart (Q1666180) (← links)
- Online scheduling on a single machine with grouped processing times (Q1723520) (← links)
- Integrated scheduling of production and distribution with release dates and capacitated deliveries (Q1793780) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- Online scheduling on a parallel batch machine with delivery times and limited restarts (Q2136511) (← links)
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery (Q2176828) (← links)
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825) (← links)
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440) (← links)
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan (Q2257290) (← links)
- Semi-online two-level supply chain scheduling problems (Q2434290) (← links)
- On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time (Q2434291) (← links)
- Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
- Online Single Machine Scheduling to Minimize the Maximum Starting Time (Q4595323) (← links)