Nonstrict vector summation in multi-operation scheduling
From MaRDI portal
Publication:1273125
DOI10.1023/A:1018908013582zbMath0913.90181MaRDI QIDQ1273125
Publication date: 7 March 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
algorithmsflow shopopen shopjob shoppolynomial-time approximationassembly lineminimum makespanmulti-operation schedulingnonstrict vector summationsequencing of vectors
Related Items
Some positive news on the proportionate open shop problem ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Open block scheduling in optical communication networks ⋮ On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion ⋮ The flow shop problem with no-idle constraints: a review and approximation
