Complex Sequencing Problems and Local Search Heuristics

P. Brucker; Johann L. Hurink

Complex Sequencing Problems and Local Search Heuristics

P. Brucker
, Johann L. Hurink

Discrete Mathematics and Mathematical Programming

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

Abstract

Many problems can be formulated as complex sequencing problems. We will present problems in flexible manufacturing that have such a formulation and apply local search methods like iterative improvement, simulated annealing and tabu search to solve these problems. Computational results are reported.

Original language	Undefined
Title of host publication	Meta-Heuristics: Theory and Applications
Editors	I.H. Osman, J.P. Kelly
Place of Publication	Dordrecht
Publisher	Kluwer Academic Publishers
Pages	151-166
Number of pages	16
ISBN (Print)	0792397002
Publication status	Published - 1996

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

EWI-7638

Cite this

@inbook{4fa54d8e56a2464999883e5bc9545c2a,

title = "Complex Sequencing Problems and Local Search Heuristics",

abstract = "Many problems can be formulated as complex sequencing problems. We will present problems in flexible manufacturing that have such a formulation and apply local search methods like iterative improvement, simulated annealing and tabu search to solve these problems. Computational results are reported.",

keywords = "EWI-7638",

author = "P. Brucker and Hurink, \{Johann L.\}",

year = "1996",

language = "Undefined",

isbn = "0792397002",

pages = "151--166",

editor = "I.H. Osman and J.P. Kelly",

booktitle = "Meta-Heuristics: Theory and Applications",

publisher = "Kluwer Academic Publishers",

address = "Netherlands",

}

TY - CHAP

T1 - Complex Sequencing Problems and Local Search Heuristics

AU - Brucker, P.

AU - Hurink, Johann L.

PY - 1996

Y1 - 1996

N2 - Many problems can be formulated as complex sequencing problems. We will present problems in flexible manufacturing that have such a formulation and apply local search methods like iterative improvement, simulated annealing and tabu search to solve these problems. Computational results are reported.

AB - Many problems can be formulated as complex sequencing problems. We will present problems in flexible manufacturing that have such a formulation and apply local search methods like iterative improvement, simulated annealing and tabu search to solve these problems. Computational results are reported.

KW - EWI-7638

M3 - Chapter

SN - 0792397002

SP - 151

EP - 166

BT - Meta-Heuristics: Theory and Applications

A2 - Osman, I.H.

A2 - Kelly, J.P.

PB - Kluwer Academic Publishers

CY - Dordrecht

ER -