Metaheuristics for order scheduling problem with unequal ready times

DOI10.1155/2018/4657368zbMath1417.90079OpenAlexW2889717464WikidataQ129223062 ScholiaQ129223062MaRDI QIDQ1727107

Chin-Chia Wu, Jianyou Xu, Win-Chin Lin, Jan-Yee Kung, Jiahui Duan, Shuenn-Ren Cheng, I-Hong Chung

Publication date: 20 February 2019

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/4657368

Mathematics Subject Classification ID

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

Related Items (2)

Minimizing maximum delivery completion time for order scheduling with rejection ⋮ A learning-based two-stage optimization method for customer order scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• An order scheduling problem with position-based learning effect
• Scheduling parallel machines for the customer order problem
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling orders for multiple product types to minimize total weighted completion time
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• Approximation schemes for scheduling on parallel machines
• Makespan minimization in open shops: A polynomial time approximation scheme
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Order scheduling with tardiness objective: improved approximate solutions
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime
• Scheduling orders for multiple product types with due date related objectives
• Coordinated scheduling of customer orders for quick response
• Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
• Order Scheduling Models: Hardness and Algorithms

This page was built for publication: Metaheuristics for order scheduling problem with unequal ready times