An algorithm for scheduling jobs with critical and non critical tasks in shops with no wait, multipurpose machines and deadlines

zbMATH Open1180.90130MaRDI QIDQ3540634FDOQ3540634

Authors: A. G. Malamos, Theodora Varvarigou 

Publication date: 24 November 2008

Recommendations

• The complexity of two-job shop problems with multi-purpose unrelated machines.
• scientific article; zbMATH DE number 890241
• scientific article; zbMATH DE number 4072689
• scientific article; zbMATH DE number 4033473
• Flow shop and open shop scheduling with a critical machine and two operations per job

zbMATH Keywords

heuristicoptimization problemjob-shop schedulingNP-Hard

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: An algorithm for scheduling jobs with critical and non critical tasks in shops with no wait, multipurpose machines and deadlines

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