Nonstrict vector summation in multi-operation scheduling

DOI10.1023/A:1018908013582MaRDI QIDQ1273125zbMATH OpenFDO

Authors Sergey Sevastyanov

Publication date 7 March 1999

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

algorithmsflow shopopen shopjob shoppolynomial-time approximationassembly lineminimum makespanmulti-operation schedulingnonstrict vector summationsequencing of vectors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Nonstrict summation of vectors on the plane and its application to scheduling problems
• scientific article; zbMATH DE number 808808
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• scientific article; zbMATH DE number 2239574

Cited in

(10)

• Nonstrict summation of vectors on the plane and its application to scheduling problems
• The flow shop problem with no-idle constraints: a review and approximation
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• scientific article; zbMATH DE number 808808 (Why is no real title available?)
• 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
• Some positive news on the proportionate open shop problem
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion

This page was built for publication: Nonstrict vector summation in multi-operation scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273125)