Online scheduling of incompatible unit-length job families with lookahead
From MaRDI portal
Publication:2250449
DOI10.1016/J.TCS.2014.05.024zbMATH Open1360.90129OpenAlexW1977081351MaRDI QIDQ2250449FDOQ2250449
Authors: Wenhua Li, Jinjiang Yuan, Sufang Yang 
Publication date: 7 July 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.024
Recommendations
- On-line algorithms for incompatible job families on parallel machines scheduling 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
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms in batch processing
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line algorithms for minimizing makespan on batch processing machines
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Scheduling unit length jobs on parallel machines with lookahead information
- How much can lookahead help in online single machine scheduling
- The Batch Loading and Scheduling Problem
- Control of a batch-processing machine: A computational approach
- Best semi-online algorithms for unbounded parallel batch scheduling
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
Cited In (11)
- On-line scheduling on a machine of two families with lookahead
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
- Semi-online scheduling on two identical parallel machines with initial-lookahead information
- 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
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- Scheduling unit length jobs on parallel machines with lookahead information
- Title not available (Why is that?)
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
This page was built for publication: Online scheduling of incompatible unit-length job families with lookahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250449)
