Tailoring customer order scheduling search algorithms

DOI10.1016/J.COR.2019.04.015MaRDI QIDQ2003430zbMATH OpenOpenAlexFDO

Authors Vahid Riahi, M. A. Hakim Newton, Abdul Sattar, Md Masbaul Alam Polash

Publication date 8 July 2019

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

Full work available at URL http://hdl.handle.net/10072/384525

zbMATH Keywords

customer orderheuristiclocal searchscheduling

Mathematics Subject Classification ID

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

Recommendations

• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Order scheduling with tardiness objective: improved approximate solutions
• Coordinated scheduling of customer orders for quick response
• A learning-based two-stage optimization method for customer order scheduling
• The complexity of customer order scheduling problems on parallel machines

Cites work

• An order scheduling problem with position-based learning effect
• Coordinated scheduling of customer orders for quick response
• Customer order scheduling to minimize the number of late jobs
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• scientific article; zbMATH DE number 2221456 (Why is no real title available?)
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Order scheduling in an environment with dedicated resources in parallel
• Order scheduling with tardiness objective: improved approximate solutions

Cited in

(8)

• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Heuristic optimization of sequence of customer orders
• Customer order scheduling to minimize the number of late jobs
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing
• Predictive-reactive strategy for identical parallel machine rescheduling
• A learning-based two-stage optimization method for customer order scheduling
• Solving customer order scheduling problems with an iterated greedy algorithm
• Minimizing maximum delivery completion time for order scheduling with rejection

This page was built for publication: Tailoring customer order scheduling search algorithms

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