New approximate algorithms for the customer order scheduling problem with total completion time objective
type: Item
instance of: scholarly article
title: New approximate algorithms for the customer order scheduling problem with total completion time objective
zbMATH Open document ID: 1391.90262
author: Jose M. Framinan
author: Paz Perez-Gonzalez
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: https://idus.us.es/handle//11441/96657
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6901291
zbMATH Keywords: order scheduling
zbMATH Keywords: completion times
zbMATH Keywords: heuristics
MaRDI profile type: Publication
OpenAlex ID: W2520193567
cites work: Coordinated scheduling of customer orders for quick response
cites work: The customer order lead-time problem on parallel machines
cites work: Q5702308
cites work: Order scheduling in an environment with dedicated resources in parallel
cites work: Scheduling orders for multiple product types to minimize total weighted completion time
cites work: Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
cites work: Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
cites work: Open shops with jobs overlap
cites work: The complexity of customer order scheduling problems on parallel machines
cites work: Scheduling parallel machines for the customer order problem
DOI: 10.1016/J.COR.2016.09.010
Recommended article: Order scheduling with tardiness objective: improved approximate solutions
Recommended article: Approximating Weighted Completion Time for Order Scheduling with Setup Times
Recommended article: Customer order scheduling on a single machine with family setup times: complexity and algorithms
Recommended article: The complexity of customer order scheduling problems on parallel machines
Recommended article: Q2932933
Recommended article: Tailoring customer order scheduling search algorithms
Recommended article: Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
Recommended article: An integrated optimization approach for order assignment and scheduling problems
Recommended article: Scheduling on parallel machines to minimise maximum lateness for the customer order problem
Recommended article: Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
description: scientific article; zbMATH DE number 6901291