A Non-Numerical Approach to Production Scheduling Problems
From MaRDI portal
Publication:5378663
DOI10.1287/opre.3.4.429zbMath1414.90145OpenAlexW2071502501MaRDI QIDQ5378663
Publication date: 3 June 2019
Published in: Journal of the Operations Research Society of America (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.3.4.429
Related Items (10)
On some geometric methods in scheduling theory: A survey ⋮ A survey of job shop scheduling problem: the types and models ⋮ Parallel dedicated machines scheduling with chain precedence constraints ⋮ The complexity of two-job shop problems with multi-purpose unrelated machines. ⋮ Complexity of mixed shop scheduling problems: A survey ⋮ Complexity of shop-scheduling problems with fixed number of jobs: a survey ⋮ A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The set of solutions for Boolea n equations ⋮ Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
This page was built for publication: A Non-Numerical Approach to Production Scheduling Problems
