The m-machine problem with parts-sequencing constraints

MaRDI QIDQ1092804zbMATH OpenFDO

Authors V. I. Levin

Publication date 1987

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

infinite-valued logicsequencing constraintstime-optimal processing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Review text

The problem of time-optimal processing of n parts by m machines is generalized by introducing sequencing constraints on the parts. A method of solution of the generalized problem is proposed, based on the apparatus of infinite-valued logic and logical determinants, which reflect various characteristics of the processing time matrix.

Recommendations

• An \(M\)-stage system with indeterminate processing time. II: Schedule optimization
• An \(M\)-stage system with indeterminate processing time. I: Schedule optimization
• Publication:3481475
• Sequencing with restrictions in processing times
• The problem of three machines with indeterminate times of processing

Cited in

(3)

• An \(M\)-stage system with indeterminate processing time. II: Schedule optimization
• scientific article; zbMATH DE number 3850807 (Why is no real title available?)
• scientific article; zbMATH DE number 1558221 (Why is no real title available?)

This page was built for publication: The m-machine problem with parts-sequencing constraints

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