On the complexity of non-preemptive shop scheduling with two jobs

DOI10.1007/S00607-002-1455-ZMaRDI QIDQ1849563zbMATH OpenOpenAlexFDO

Authors Tamás Kis

Publication date 1 December 2002

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-002-1455-z

zbMATH Keywords

computational complexitymixed shop schedulingpseudo-polynomial time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling two jobs with fixed and nonfixed routes
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• scientific article; zbMATH DE number 764421

Cited in

(7)

• Scheduling three chains on two parallel machines
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• On the complexity of two machine job-shop scheduling with regular objective functions
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• Job Shop Scheduling With Two Jobs And Nonregular Objective Functions
• Two-machine job-shop scheduling with one joint job
• V-shop scheduling

This page was built for publication: On the complexity of non-preemptive shop scheduling with two jobs

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