New approximate algorithms for the customer order scheduling problem with total completion time objective

DOI10.1016/j.cor.2016.09.010zbMath1391.90262OpenAlexW2520193567MaRDI QIDQ1652070

Jose M. Framinan, Paz Perez-Gonzalez

Publication date: 11 July 2018

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

Full work available at URL: https://idus.us.es/handle//11441/96657

zbMATH Keywords

heuristicsorder schedulingcompletion times

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (16)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems ⋮ The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic ⋮ Spatial and temporal optimization for smart warehouses with fast turnover ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems ⋮ A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ Tailoring customer order scheduling search algorithms ⋮ A genetic algorithm for scheduling open shops with sequence-dependent setup times

Cites Work

• Unnamed Item
• Scheduling parallel machines for the customer order problem
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling orders for multiple product types to minimize total weighted completion time
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• Open shops with jobs overlap
• The complexity of customer order scheduling problems on parallel machines
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
• Coordinated scheduling of customer orders for quick response
• The customer order lead-time problem on parallel machines

This page was built for publication: New approximate algorithms for the customer order scheduling problem with total completion time objective