Scheduling one batch processor subject to job release dates
From MaRDI portal
Publication:1582073
DOI10.1016/S0166-218X(00)00181-5zbMath0969.90046WikidataQ127860074 ScholiaQ127860074MaRDI QIDQ1582073
Publication date: 4 October 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (38)
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost ⋮ A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times ⋮ Online scheduling on bounded batch machines to minimize the maximum weighted completion time ⋮ The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan ⋮ A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES ⋮ Optimal on-line algorithms for one batch machine with grouped processing times ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Single machine unbounded parallel-batch scheduling with forbidden intervals ⋮ Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs ⋮ Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time ⋮ A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines ⋮ Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan ⋮ Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Scheduling of deteriorating jobs with release dates to minimize the maximum lateness ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan ⋮ Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times ⋮ A flexible on-line scheduling algorithm for batch machine with infinite capacity ⋮ Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan ⋮ On-line scheduling algorithms for a batch machine with finite capacity ⋮ Online scheduling on unbounded parallel-batch machines to minimize the makespan ⋮ Bounded single-machine parallel-batch scheduling with release dates and rejection ⋮ On-line scheduling with delivery time on a single batch machine ⋮ Scheduling jobs with agreeable processing times and due dates on a single batch processing machine ⋮ THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ On lower and upper bounds for single machine parallel batch scheduling ⋮ On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ Online unbounded batch scheduling on parallel machines with delivery times ⋮ On scheduling an unbounded batch machine
Cites Work
- Unnamed Item
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: Scheduling one batch processor subject to job release dates
