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

DOI10.1016/S0377-2217(02)00675-6zbMath1043.90029MaRDI QIDQ1410331

Xiaolan Xie, Yazid Mati

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

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

Related Items

An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• Complexity of mixed shop scheduling problems: A survey
• A new lower bound for the job-shop scheduling problem
• Solution of the Akers-Friedman Scheduling Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• A Geometric Model and a Graphical Algorithm for a Sequencing Problem
• A Non-Numerical Approach to Production Scheduling Problems