On-line algorithms for incompatible job families on parallel machines scheduling with lookahead

DOI10.15960/J.CNKI.ISSN.1007-6093.2015.04.012MaRDI QIDQ2993685zbMATH OpenFDO

Authors Wenhua Li, Xing Chai, Hang Yuan, Sufang Yang

Publication date 10 August 2016

zbMATH Keywords

competitive ratiomakespanonline schedulingincompatible job familiesparallel batching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Online scheduling of incompatible unit-length job families with lookahead
• On-line scheduling on a machine of two families with lookahead
• Online scheduling of two-machine flowshop with lookahead and incompatible job families
• 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

Cited in

(9)

• On-line scheduling on a machine of two families with lookahead
• Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
• Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
• Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
• Online scheduling of two-machine flowshop with lookahead and incompatible job families
• Online Scheduling with Lookahead: Multipass Assembly Lines
• Online scheduling of incompatible unit-length job families with lookahead
• Online machine minimization with lookahead
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead

This page was built for publication: On-line algorithms for incompatible job families on parallel machines scheduling with lookahead

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