Scheduling one batch processor subject to job release dates

DOI10.1016/S0166-218X(00)00181-5MaRDI QIDQ1582073zbMATH OpenWikidataFDO

Authors Zhaohui Liu, Wen-Ci Yu

Publication date 4 October 2001

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

heuristicschedulingNP-hardnessbatch processor

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• Scheduling jobs with release dates on parallel batch processing machines
• Minimizing makespan in batch machine scheduling
• scientific article; zbMATH DE number 2080262
• Efficient scheduling algorithms for a single batch processing machine

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Efficient scheduling algorithms for a single batch processing machine
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Scheduling Groups of Jobs on a Single Machine
• Scheduling a batching machine

Cited in

(38)

• A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• Single machine unbounded parallel-batch scheduling with forbidden intervals
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
• On-line scheduling algorithms for a batch machine with finite capacity
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
• Optimal on-line algorithms for one batch machine with grouped processing times
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• A survey of scheduling with parallel batch (p-batch) processing
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
• On-line scheduling with delivery time on a single batch machine
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
• On scheduling an unbounded batch machine
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• 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
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
• On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
• Online batch scheduling with kind release times and incompatible families to minimize makespan
• Online unbounded batch scheduling on parallel machines with delivery times
• Online over time scheduling on parallel-batch machines: a survey
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
• Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time
• On lower and upper bounds for single machine parallel batch scheduling

This page was built for publication: Scheduling one batch processor subject to job release dates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582073)