Job shop scheduling by local search

R.J.M. Vaessens; E.H.L. Aarts; J.K. Lenstra

Job shop scheduling by local search

R.J.M. Vaessens
, E.H.L. Aarts
, J.K. Lenstra

Onderzoeksoutput: Boek/rapport › Rapport › Academic

474 Downloads (Pure)

Samenvatting

We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem instances.

Originele taal-2	Engels
Plaats van productie	Eindhoven
Uitgeverij	Technische Universiteit Eindhoven
Aantal pagina's	21
Status	Gepubliceerd - 1994

Publicatie series

Naam	Memorandum COSOR
Volume	9405
ISSN van geprinte versie	0926-4493

Toegang tot document

385216Definitieve gepubliceerde versie, 7,58 MB

Citeer dit

@book{68f30663c1e045b6bd1c373cef2a7c8b,

title = "Job shop scheduling by local search",

abstract = "We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem instances.",

author = "R.J.M. Vaessens and E.H.L. Aarts and J.K. Lenstra",

year = "1994",

language = "English",

series = "Memorandum COSOR",

publisher = "Technische Universiteit Eindhoven",

}

TY - BOOK

T1 - Job shop scheduling by local search

AU - Vaessens, R.J.M.

AU - Aarts, E.H.L.

AU - Lenstra, J.K.

PY - 1994

Y1 - 1994

N2 - We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem instances.

AB - We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem instances.

M3 - Report

T3 - Memorandum COSOR

BT - Job shop scheduling by local search

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -

Job shop scheduling by local search

Samenvatting

Publicatie series

Toegang tot document

Vingerafdruk

Citeer dit