Pages that link to "Item:Q1022586"
From MaRDI portal
The following pages link to On-line scheduling with delivery time on a single batch machine (Q1022586):
Displaying 26 items.
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost (Q319441) (← links)
- Optimal on-line algorithms for one batch machine with grouped processing times (Q411231) (← links)
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times (Q423933) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Online batch scheduling on parallel machines with delivery times (Q719274) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time (Q905848) (← 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)
- Batching and delivery in semi-online distribution systems (Q1759861) (← links)
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times (Q1944199) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- Online scheduling on a single machine with linear deteriorating processing times and delivery times (Q2082204) (← links)
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Online unbounded batch scheduling on parallel machines with delivery times (Q2354308) (← links)
- Semi-online two-level supply chain scheduling problems (Q2434290) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
- Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
- On-line algorithms for minimizing makespan on batch processing machines (Q2741218) (← links)
- Online batch scheduling with known information in advance (Q2825064) (← links)
- Online scheduling on bounded parallel-batch machines (Q3461600) (← links)
- Single batch machine scheduling with deliveries (Q4632900) (← links)
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)
- On-Line Scheduling In Assembly Processes (Q5888208) (← links)