A cyclic production problem: an application of max-algebra

W.M. Nawijn

doi:10.1016/S0377-2217(96)00336-0

A cyclic production problem: an application of max-algebra

W.M. Nawijn

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

4 Downloads (Pure)

Abstract

Given are m identical machines, each of which performs the same N operations Oi, 1 ≤ i ≤ N, cyclically and indefinitely, i.e. a production run on a machine looksO1, O2,…,ON, O1, O2,…,ON, O1…. There are nim to to perform operation Oi. The tools are transported between the machines by means of an infinitely fast transport device. Given a particular transport policy we prove the existence of stationary cyclic behaviour, determine the corresponding cycle time, and investigate the long run behaviour of the system starting from a given initial state.

Original language	Undefined
Pages (from-to)	187-200
Number of pages	14
Journal	European journal of operational research
Volume	104
Issue number	1
DOIs	https://doi.org/10.1016/S0377-2217(96)00336-0
Publication status	Published - 1998

Keywords

Production
Eigenvalue problem
Knapsack function
METIS-140558
Cycle time
Minimax-algebra
IR-73917

UN SDGs

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

Access to Document

10.1016/S0377-2217(96)00336-0

Cite this

@article{16121a762b7a484bb143b96b251a5f7f,

title = "A cyclic production problem: an application of max-algebra",

abstract = "Given are m identical machines, each of which performs the same N operations Oi, 1 ≤ i ≤ N, cyclically and indefinitely, i.e. a production run on a machine looksO1, O2,…,ON, O1, O2,…,ON, O1…. There are nim to to perform operation Oi. The tools are transported between the machines by means of an infinitely fast transport device. Given a particular transport policy we prove the existence of stationary cyclic behaviour, determine the corresponding cycle time, and investigate the long run behaviour of the system starting from a given initial state.",

keywords = "Production, Eigenvalue problem, Knapsack function, METIS-140558, Cycle time, Minimax-algebra, IR-73917",

author = "W.M. Nawijn",

year = "1998",

doi = "10.1016/S0377-2217(96)00336-0",

language = "Undefined",

volume = "104",

pages = "187--200",

journal = "European journal of operational research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A cyclic production problem: an application of max-algebra

AU - Nawijn, W.M.

PY - 1998

Y1 - 1998

N2 - Given are m identical machines, each of which performs the same N operations Oi, 1 ≤ i ≤ N, cyclically and indefinitely, i.e. a production run on a machine looksO1, O2,…,ON, O1, O2,…,ON, O1…. There are nim to to perform operation Oi. The tools are transported between the machines by means of an infinitely fast transport device. Given a particular transport policy we prove the existence of stationary cyclic behaviour, determine the corresponding cycle time, and investigate the long run behaviour of the system starting from a given initial state.

AB - Given are m identical machines, each of which performs the same N operations Oi, 1 ≤ i ≤ N, cyclically and indefinitely, i.e. a production run on a machine looksO1, O2,…,ON, O1, O2,…,ON, O1…. There are nim to to perform operation Oi. The tools are transported between the machines by means of an infinitely fast transport device. Given a particular transport policy we prove the existence of stationary cyclic behaviour, determine the corresponding cycle time, and investigate the long run behaviour of the system starting from a given initial state.

KW - Production

KW - Eigenvalue problem

KW - Knapsack function

KW - METIS-140558

KW - Cycle time

KW - Minimax-algebra

KW - IR-73917

U2 - 10.1016/S0377-2217(96)00336-0

DO - 10.1016/S0377-2217(96)00336-0

M3 - Article

SN - 0377-2217

VL - 104

SP - 187

EP - 200

JO - European journal of operational research

JF - European journal of operational research

IS - 1

ER -