Online over time scheduling on parallel-batch machines: a survey (Q489147)

From MaRDI portal

Revision as of 14:55, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Online over time scheduling on parallel-batch machines: a survey	scientific article

Statements

scholarly article

0 references

Online over time scheduling on parallel-batch machines: a survey (English)

0 references

0 references

0 references

0 references

Journal of the Operations Research Society of China

0 references

publication date

27 January 2015

0 references

zbMATH Keywords

online scheduling

0 references

parallel-batch machines

0 references

competitive ratio

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s40305-014-0060-0

0 references

Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time

0 references

Control of a batch-processing machine: A computational approach

0 references

Batching and delivery in semi-online distribution systems

0 references

Scheduling a batching machine

0 references

0 references

Complexity results for single-machine problems with positive finish-start time-lags

0 references

On-line scheduling a batch processing system to minimize total weighted job completion time

0 references

Semi-on-line multiprocessor scheduling with given total processing time

0 references

Approximation algorithms in batch processing

0 references

Optimal on-line algorithms for one batch machine with grouped processing times

0 references

Online batch scheduling on parallel machines with delivery times

0 references

Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

0 references

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan

0 references

Online scheduling in a parallel batch processing system to minimize makespan using restarts

0 references

On-line scheduling on a batch machine to minimize makespan with limited restarts

0 references

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

0 references

Online Scheduling with Known Arrival Times

0 references

Optimal on-line algorithms for single-machine scheduling

0 references

A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

0 references

0 references

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

0 references

Minimizing makespan on a single batch processing machine with dynamic job arrivals

0 references

Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs

0 references

Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time

0 references

Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead

0 references

Scheduling one batch processor subject to job release dates

0 references

A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

0 references

Online unbounded batch scheduling on parallel machines with delivery times

0 references

Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart

0 references

An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

0 references

Minimizing makespan in batch machine scheduling

0 references

A flexible on-line scheduling algorithm for batch machine with infinite capacity

0 references

On-line scheduling algorithms for a batch machine with finite capacity

0 references

Semi-online scheduling with decreasing job sizes

0 references

Semi-on-line problems on two identical machines with combined partial information

0 references

On-line scheduling with delivery time on a single batch machine

0 references

Online scheduling on unbounded parallel-batch machines to minimize the makespan

0 references

A best online algorithm for scheduling on two parallel batch machines

0 references

Online scheduling on unbounded parallel-batch machines with incompatible job families

0 references

An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times

0 references

An improved on-line algorithm for single parallel-batch machine scheduling with delivery times

0 references

A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times

0 references

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

0 references

Best semi-online algorithms for unbounded parallel batch scheduling

0 references

On-line algorithms for minimizing makespan on batch processing machines

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s40305-014-0060-0

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:489147

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q489147&oldid=35434249"