Job shop scheduling with a non-regular objective: A comparison of neighbourhood structures based on a sequencing/timing decomposition

DOI10.1080/002075499190969MaRDI QIDQ4497007zbMATHOpenAlexFDO

Authors Paolo Brandimarte, M. Maiocco

Publication date 21 August 2000

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/002075499190969

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• A neighborhood for complex job shop scheduling problems with regular objectives
• The job shop scheduling problem with convex costs
• A linear programming-based method for job shop scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Approximative procedures for no-wait job shop scheduling.

Cited in

(7)

• scientific article; zbMATH DE number 4057270 (Why is no real title available?)
• Scheduling satellite launch missions: an MILP approach
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• The job shop scheduling problem with convex costs
• A neighborhood for complex job shop scheduling problems with regular objectives
• A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times
• Dynamic scheduling for complex engineer-to-order products

This page was built for publication: Job shop scheduling with a non-regular objective: A comparison of neighbourhood structures based on a sequencing/timing decomposition

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