Scheduling incompatible tasks on two machines
type: Item
instance of: scholarly article
title: Scheduling incompatible tasks on two machines
zbMATH Open document ID: 1177.90174
author: I. N. Lushchakova
author: V. A. Strusevich
published in: European Journal of Operational Research
publication date: 2009-12-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5646303
zbMATH Keywords: two machine scheduling
zbMATH Keywords: incompatibility graph
zbMATH Keywords: max-batch
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.01.029
OpenAlex ID: W2073686894
cites work: Dynamic scheduling on a single batch processing machine with split compatibility graphs
cites work: Q5431779
cites work: Time slot scheduling of compatible jobs
cites work: A hypocoloring model for batch scheduling
cites work: Scheduling batches with sequential job processing for two-machine flow and open shops
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Scheduling parallel dedicated machines under a single non-shared resource
cites work: Scheduling problems for parallel dedicated machines under multiple resource constraints.
cites work: Scheduling parallel dedicated machines with the speeding‐up resource
cites work: Scheduling with batching: A review
cites work: Scheduling batches with simultaneous job processing for two-machine shop problems
DOI: 10.1016/J.EJOR.2009.01.029
description: scientific article; zbMATH DE number 5646303