scientific article; zbMATH DE number 2044496

zbMATH Open1042.90021MaRDI QIDQ4448360FDOQ4448360

Authors: Monaldo Mastrolilli, Roberto Solis-Oba, Klaus Jansen 

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2202/22020107.htm

Title of this publication is not available (Why is that?)

Recommendations

• Approximation schemes for job shop scheduling problems with controllable processing times
• A survey of scheduling with controllable processing times
• Just-in-time scheduling with controllable processing times on parallel machines
• Single machine scheduling with discretely controllable processing times
• A survey of results for sequencing problems with controllable processing times

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (11)

• A decomposition approach to job-shop scheduling problem with discretely controllable processing times
• Job shop scheduling with deadlines
• Some comments on sequencing with controllable processing times
• Job shop scheduling with unit processing times
• A survey of scheduling with controllable processing times
• Job-shop scheduling with processing alternatives.
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates
• Just-in-time scheduling with controllable processing times on parallel machines
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times

This page was built for publication:

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