On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

DOI10.1007/S10951-008-0084-6zbMATH Open1176.68246OpenAlexW2068498891MaRDI QIDQ835640FDOQ835640

Authors Ruyan Fu, Ji Tian, Jinjiang Yuan 

Publication date 28 August 2009

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-008-0084-6

zbMATH Keywords

competitive ratiojob familieson-line schedulingbatch machine

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

Cites work

• A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
• Approximation algorithms in batch processing
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• Minimizing makespan in batch machine scheduling
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling algorithms for a batch machine with finite capacity
• On-line scheduling on a batch machine to minimize makespan with limited restarts
• Scheduling a batching machine
• Scheduling batch processing machines with incompatible job families
• Scheduling with batching: A review
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Cited in

(20)

• The unbounded single-machine serial-batching on-line scheduling problem with family jobs to minimize makespan
• Batch machine production with perishability time windows and limited batch size
• Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
• Online-list scheduling on a single bounded parallel-batch machine to minimize makespan
• A best online algorithm for scheduling on two parallel batch machines
• An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts
• scientific article; zbMATH DE number 7235424 (Why is no real title available?)
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• Online scheduling of incompatible unit-length job families with lookahead
• Online scheduling of two-machine flowshop with lookahead and incompatible job families
• An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
• Online batch scheduling with kind release times and incompatible families to minimize makespan
• Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
• scientific article; zbMATH DE number 6402606 (Why is no real title available?)
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
• Online over time scheduling on parallel-batch machines: a survey
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan

This page was built for publication: On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

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