Online scheduling of two-machine flowshop with lookahead and incompatible job families
From MaRDI portal
Publication:2111531
Recommendations
- Online scheduling of incompatible unit-length job families with lookahead
- On-line scheduling on a machine of two families with lookahead
- On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- scientific article; zbMATH DE number 7235424
Cites work
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 7235424 (Why is no real title available?)
- A survey of scheduling with parallel batch (p-batch) processing
- An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- How much can lookahead help in online single machine scheduling
- On-line algorithms for minimizing makespan on batch processing machines
- On-line scheduling on a machine of two families with lookahead
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
- Online scheduling of incompatible unit-length job families with lookahead
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost
- Scheduling unit length jobs on parallel machines with lookahead information
Cited in
(5)- On-line scheduling on a machine of two families with lookahead
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
- On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
- Online scheduling of incompatible unit-length job families with lookahead
- Online interval scheduling on two related machines: the power of lookahead
This page was built for publication: Online scheduling of two-machine flowshop with lookahead and incompatible job families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111531)