Machine scheduling with contiguous processing constraints

Authors:
Lan Lin;Yixun Lin
Affiliations:
School of Electronics and Information Engineering, Tongji University, Shanghai 200092, China;Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China
Venue:
Information Processing Letters
Year:
2013

Citing 5
Cited 0

Scheduling Algorithms

Scheduling Algorithms
A simple test for the consecutive ones property

Journal of Algorithms
Scheduling Problems with Two Competing Agents

Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

In classical machine scheduling problems the jobs are independent in general. Motivated by some special processing environments, this paper studies a model of scheduling problems with constraints that some groups of jobs have to be processed contiguously. It turns out that the feasibility of these constrained scheduling problems is equivalent to the recognition of interval hypergraphs. For this new model, two examples of single machine scheduling problems with polynomial-time algorithms are taken as a start.