Solution of the Akers-Friedman Scheduling Problem

DOI10.1287/OPRE.8.6.782MaRDI QIDQ3281502zbMATH OpenOpenAlexFDO

Authors Wlodzimierz Szwarc

Publication date 1960

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.8.6.782

zbMATH Keywords

applications of probability theory and statistics

Cited in

(15)

• An efficient algorithm for the job-shop problem with two jobs
• Job-shop scheduling with multi-purpose machines
• The complexity of shop-scheduling problems with two or three jobs
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• Scheduling two jobs with fixed and nonfixed routes
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• Deterministic job-shop scheduling: Past, present and future
• NP-hardness of shop-scheduling problems with three jobs
• Parallel dedicated machines scheduling with chain precedence constraints
• Complexity of mixed shop scheduling problems: A survey
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
• Parameterized mixed graph coloring
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• On some sequencing problems

This page was built for publication: Solution of the Akers-Friedman Scheduling Problem

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