<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Scheduling chains with identical jobs and constant delays on a single machine

Loading...
Thumbnail Image

Departments

Item type:Organizational Unit,

School / College / Institute

Item type:Organizational Unit,

Program

KU-Authors

Organization Authors

Co-Authors

Brucker, Peter

Knust, Sigrid

Date

Language

Embargo Status

N/A

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

In this paper we study the single-machine problem 1|chains(l), p j = p|∑ C j in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between consecutive jobs in a chain are satisfied and the sum of all completion times of the jobs is minimized. We show that this problem is polynomially solvable.

Source

Publisher

Springer

Citation

item.page.haspartof

Source

Mathematical Methods of Operations Research

item.page.ispartofseries

item.page.edition

DOI

10.1007/s00186-005-0014-8

item.page.datauri

item.page.link

Rights

N/A

Copyrights Note

Rights and licensing

N/A

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators