Scheduling by positional completion times

J.A. Hoogeveen, S.L. Velde, van de

Research output: Book/ReportReportAcademic

18 Downloads (Pure)

Abstract

We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one.?? This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for ??flowshop problems??, where the jobs only differ in their processing times.?? We illustrate the effectiveness of this type of formulation for a two??-machine fl??owshop problem where the fi??rst machine is a batching machine that executes the jobs in constant time??. Keywords and Phrases:?? machine scheduling problems,?? mathematical formulation??, positional completion times??, batching,?? fl??ow shop scheduling,?? total completion time??, Lagrangian relaxation??.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages15
Publication statusPublished - 1995

Publication series

NameMemorandum COSOR
Volume9522
ISSN (Print)0926-4493

Fingerprint

scheduling
time

Cite this

Hoogeveen, J. A., & Velde, van de, S. L. (1995). Scheduling by positional completion times. (Memorandum COSOR; Vol. 9522). Eindhoven: Technische Universiteit Eindhoven.
Hoogeveen, J.A. ; Velde, van de, S.L. / Scheduling by positional completion times. Eindhoven : Technische Universiteit Eindhoven, 1995. 15 p. (Memorandum COSOR).
@book{e57a560253be4b31b306c14fddaec1f5,
title = "Scheduling by positional completion times",
abstract = "We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one.?? This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for ??flowshop problems??, where the jobs only differ in their processing times.?? We illustrate the effectiveness of this type of formulation for a two??-machine fl??owshop problem where the fi??rst machine is a batching machine that executes the jobs in constant time??. Keywords and Phrases:?? machine scheduling problems,?? mathematical formulation??, positional completion times??, batching,?? fl??ow shop scheduling,?? total completion time??, Lagrangian relaxation??.",
author = "J.A. Hoogeveen and {Velde, van de}, S.L.",
year = "1995",
language = "English",
series = "Memorandum COSOR",
publisher = "Technische Universiteit Eindhoven",

}

Hoogeveen, JA & Velde, van de, SL 1995, Scheduling by positional completion times. Memorandum COSOR, vol. 9522, Technische Universiteit Eindhoven, Eindhoven.

Scheduling by positional completion times. / Hoogeveen, J.A.; Velde, van de, S.L.

Eindhoven : Technische Universiteit Eindhoven, 1995. 15 p. (Memorandum COSOR; Vol. 9522).

Research output: Book/ReportReportAcademic

TY - BOOK

T1 - Scheduling by positional completion times

AU - Hoogeveen, J.A.

AU - Velde, van de, S.L.

PY - 1995

Y1 - 1995

N2 - We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one.?? This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for ??flowshop problems??, where the jobs only differ in their processing times.?? We illustrate the effectiveness of this type of formulation for a two??-machine fl??owshop problem where the fi??rst machine is a batching machine that executes the jobs in constant time??. Keywords and Phrases:?? machine scheduling problems,?? mathematical formulation??, positional completion times??, batching,?? fl??ow shop scheduling,?? total completion time??, Lagrangian relaxation??.

AB - We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one.?? This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for ??flowshop problems??, where the jobs only differ in their processing times.?? We illustrate the effectiveness of this type of formulation for a two??-machine fl??owshop problem where the fi??rst machine is a batching machine that executes the jobs in constant time??. Keywords and Phrases:?? machine scheduling problems,?? mathematical formulation??, positional completion times??, batching,?? fl??ow shop scheduling,?? total completion time??, Lagrangian relaxation??.

M3 - Report

T3 - Memorandum COSOR

BT - Scheduling by positional completion times

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -

Hoogeveen JA, Velde, van de SL. Scheduling by positional completion times. Eindhoven: Technische Universiteit Eindhoven, 1995. 15 p. (Memorandum COSOR).