Pages that link to "Item:Q1582073"
From MaRDI portal
The following pages link to Scheduling one batch processor subject to job release dates (Q1582073):
Displayed 38 items.
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- Optimal on-line algorithms for one batch machine with grouped processing times (Q411231) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
- On-line scheduling with delivery time on a single batch machine (Q1022586) (← links)
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971) (← links)
- On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs (Q1944138) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- On lower and upper bounds for single machine parallel batch scheduling (Q2091210) (← links)
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← 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)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2574421) (← links)
- A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730) (← links)
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)