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

From MaRDI portal
Publication:1652070

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




Related Items (16)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution proceduresMinimizing maximum delivery completion time for order scheduling with rejectionNew efficient heuristics for scheduling open shops with makespan minimizationOptimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systemsThe 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristicSpatial and temporal optimization for smart warehouses with fast turnoverSingle batch machine scheduling with dual setup times for autoclave molding manufacturingA learning-based two-stage optimization method for customer order schedulingAssembly flowshop scheduling problem: speed-up procedure and computational evaluationA constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimizationAn order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systemsA hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activitiesMetaheuristics for order scheduling problem with unequal ready timesOrder scheduling with tardiness objective: improved approximate solutionsTailoring customer order scheduling search algorithmsA genetic algorithm for scheduling open shops with sequence-dependent setup times



Cites Work


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