Tailoring customer order scheduling search algorithms
type: Item
instance of: scholarly article
title: Tailoring customer order scheduling search algorithms
zbMATH Open document ID: 1458.90350
author: Vahid Riahi
author: M. A. Hakim Newton
author: Abdul Sattar
author: Md Masbaul Alam Polash
published in: Computers \& Operations Research
publication date: 2019-07-08T00:00:00Z
full work available at URL: http://hdl.handle.net/10072/384525
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7077524
zbMATH Keywords: customer order
zbMATH Keywords: scheduling
zbMATH Keywords: heuristic
zbMATH Keywords: local search
MaRDI profile type: Publication
OpenAlex ID: W2937671416
cites work: Coordinated scheduling of customer orders for quick response
cites work: New approximate algorithms for the customer order scheduling problem with total completion time objective
cites work: Order scheduling with tardiness objective: improved approximate solutions
cites work: Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
cites work: Q5702308
cites work: Order scheduling in an environment with dedicated resources in parallel
cites work: Customer order scheduling to minimize the number of late jobs
cites work: An order scheduling problem with position-based learning effect
DOI: 10.1016/J.COR.2019.04.015
description: scientific article; zbMATH DE number 7077524