Job Shop Scheduling With Two Jobs And Nonregular Objective Functions

DOI10.1080/03155986.2001.11732439MaRDI QIDQ5888206zbMATH OpenOpenAlexFDO

Authors Andrea Pacifici, Alessandro Agnetis, Pitu B. Mirchandani, Dario Pacciarelli

Publication date 24 April 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• On the complexity of two machine job-shop scheduling with regular objective functions
• Optimal job-shop scheduling with two jobs in systems with unrestricted paths
• On the complexity of non-preemptive shop scheduling with two jobs
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• The job shop scheduling problem with convex costs

Cited in

(3)

• On the complexity of two machine job-shop scheduling with regular objective functions
• A neighborhood for complex job shop scheduling problems with regular objectives
• Two-machine job-shop scheduling with one joint job

This page was built for publication: Job Shop Scheduling With Two Jobs And Nonregular Objective Functions

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