TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
From MaRDI portal
Publication:4094640
DOI10.15807/jorsj.19.1zbMath0328.90036OpenAlexW2102814010MaRDI QIDQ4094640
Publication date: 1976
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.19.1
Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25)
Related Items (10)
Sequencing with general precedence constraints ⋮ The clustered flow-shop problem ⋮ Job lateness in a two-machine flowshop with setup times separated ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems ⋮ Johnson's rule, composite jobs and the relocation problem ⋮ Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times ⋮ A decomposition theory based on a dominance relation and composite jobs ⋮ Clustered flow shop models ⋮ Algorithms for two-machine flow-shop sequencing with precedence constraints
This page was built for publication: TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
