Two-agent single machine scheduling with forbidden intervals

We consider the resumable version of the two-agent single machine scheduling problems with forbidden intervals in which the jobs cannot be processed. The goal is to minimize the sum of the objective functions of the two agents. Polynomial and pseudo-polynomial time algorithms are presented for vario...

Full description

Saved in:

Bibliographic Details
Published in:	Applied Mathematics-A Journal of Chinese Universities Vol. 30; no. 1; pp. 93 - 101
Main Authors:	Feng, Qi, Li, Shi-sheng, Shang, Wei-ping
Format:	Journal Article
Language:	English
Published:	Heidelberg Editorial Committee of Applied Mathematics - A Journal of Chinese Universities 01.03.2015
Subjects:	Applications of Mathematics Mathematics Mathematics and Statistics forbidden interval dynamic programming 90C39 two-agent scheduling 90B36
ISSN:	1005-1031, 1993-0445
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We consider the resumable version of the two-agent single machine scheduling problems with forbidden intervals in which the jobs cannot be processed. The goal is to minimize the sum of the objective functions of the two agents. Polynomial and pseudo-polynomial time algorithms are presented for various combinations of regular scheduling objective functions.
ISSN:	1005-1031 1993-0445
DOI:	10.1007/s11766-015-3076-2