Finding the largest suborder of fixed width
From MaRDI portal
Publication:687176
DOI10.1007/BF00420355zbMath0781.06006MaRDI QIDQ687176
Publication date: 17 October 1993
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00420355
scheduling; combinatorial optimization; polynomial time; minimum cost network flow problem; largest suborder of fixed width
06A07: Combinatorics of partially ordered sets
90B10: Deterministic network models in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Minimizing the number of tardy jobs with precedence constraints and agreeable due dates, The just-in-time scheduling problem in a flow-shop scheduling system, Minimizing the number of tardy jobs in single machine sequencing, Just-in-time scheduling with controllable processing times on parallel machines, Algorithms for Necklace Maps, Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
Cites Work