Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

DOI10.1016/j.cor.2010.09.004zbMath1202.90111OpenAlexW2127848660MaRDI QIDQ613514

Taylan Ilhan, M. Selim Akturk

Publication date: 20 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

single machine schedulingweighted tardinesscontrollable processing timetool management

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (6)

Loading and scheduling for flexible manufacturing systems with controllable processing times ⋮ Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ Throughput optimization for the Robotic Cell Problem with Controllable Processing Times ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates

Cites Work

• Unnamed Item
• Unnamed Item
• Considering manufacturing cost and scheduling performance on a CNC turning machine
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
• Minimizing total tardiness on a single machine with controllable processing times
• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• Minimizing the total weighted flow time in a single machine with controllable processing times
• A survey of scheduling with controllable processing times
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling

This page was built for publication: Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness