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

DOI10.1080/002075499190969zbMATH Open0949.90530OpenAlexW2103575349MaRDI QIDQ4497007FDOQ4497007

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

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.

Mathematics Subject Classification ID

Production models (90B30)

Cited In (7)

• Dynamic scheduling for complex engineer-to-order products
• Scheduling satellite launch missions: an MILP approach
• A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times
• A neighborhood for complex job shop scheduling problems with regular objectives
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• Title not available (Why is that?)
• The job shop scheduling problem with convex costs

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)