Single CNC machine scheduling with controllable processing times and multiple due dates

DOI10.1080/00207540701262913zbMATH Open1154.90352OpenAlexW2074133360MaRDI QIDQ3605428FDOQ3605428

Authors: Mehmet Oguz Atan, M. Selim Aktürk 

Publication date: 24 February 2009

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

Full work available at URL: http://hdl.handle.net/11693/22983

Recommendations

• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Scheduling parallel CNC machines with time/cost trade-off considerations
• Single Machine Common Due Window Scheduling with Controllable Job Processing Times
• Single-machine sequencing with controllable processing times

zbMATH Keywords

heuristicsschedulingcontrollable processing timesmultiple due datesorder rejectiontotal weighted tardiness and earliness

Mathematics Subject Classification ID

Production models (90B30)

Cites Work

• Techniques for scheduling with rejection
• Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
• Customer lead time management when both demand and price are lead time sensitive.
• Order acceptance strategies in a production-to-order environment with setup times and due-dates
• Order acceptance with weighted tardiness
• Machine scheduling with earliness, tardiness and non-execution penalties
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• The Single Machine Early/Tardy Problem
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Considering manufacturing cost and scheduling performance on a CNC turning machine
• Requirements Planning with Pricing and Order Selection Flexibility
• A Single Machine Model for Determination of Optimal Due Dates and Sequence
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Single-machine sequencing with controllable processing times
• Scheduling to minimize the total compression and late costs

Cited In (5)

• Learning variable neighborhood search for a scheduling problem with time windows and rejections
• Fabrication scheduling on a single machine with due date constraints
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem

This page was built for publication: Single CNC machine scheduling with controllable processing times and multiple due dates

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