Tailoring customer order scheduling search algorithms

DOI10.1016/j.cor.2019.04.015zbMath1458.90350OpenAlexW2937671416MaRDI QIDQ2003430

Abdul Sattar, Vahid Riahi, M. A. Hakim Newton, 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

schedulinglocal searchheuristiccustomer order

Mathematics Subject Classification ID

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

Related Items (4)

Minimizing maximum delivery completion time for order scheduling with rejection ⋮ 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

Cites Work

• Unnamed Item
• An order scheduling problem with position-based learning effect
• Order scheduling in an environment with dedicated resources in parallel
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Order scheduling with tardiness objective: improved approximate solutions
• Customer order scheduling to minimize the number of late jobs
• Coordinated scheduling of customer orders for quick response

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