The complexity of two-job shop problems with multi-purpose unrelated machines.

DOI10.1016/S0377-2217(02)00675-6MaRDI QIDQ1410331zbMATHFDO

Authors Yazid Mati, Xiaolan Xie

Publication date 14 October 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Complexity analysisShop schedulingMulti-purpose unrelated machines

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Complexity of scheduling problems with multi-purpose machines
• The complexity of shop-scheduling problems with two or three jobs
• Preemptive job-shop scheduling problems with a fixed number of jobs
• On the complexity of non-preemptive shop scheduling with two jobs
• The computational complexities of two multi-purpose machines scheduling problem with setup times

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• A Geometric Model and a Graphical Algorithm for a Sequencing Problem
• A Non-Numerical Approach to Production Scheduling Problems
• A new lower bound for the job-shop scheduling problem
• An efficient algorithm for the job-shop problem with two jobs
• Complexity of mixed shop scheduling problems: A survey
• Job-shop scheduling with multi-purpose machines
• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Solution of the Akers-Friedman Scheduling Problem
• The complexity of shop-scheduling problems with two or three jobs

Cited in

(8)

• Job-shop scheduling in a body shop
• Two-machine job-shop scheduling with one joint job
• The computational complexities of two multi-purpose machines scheduling problem with setup times
• On the complexity of non-preemptive shop scheduling with two jobs
• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
• A note on scheduling alternative operations in two-machine flowshops
• An algorithm for scheduling jobs with critical and non critical tasks in shops with no wait, multipurpose machines and deadlines
• Scheduling with arranged multi-purpose machines

This page was built for publication: The complexity of two-job shop problems with multi-purpose unrelated machines.

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