Order scheduling with tardiness objective: improved approximate solutions

DOI10.1016/j.ejor.2017.10.064zbMath1403.90325OpenAlexW2766070900MaRDI QIDQ1754153

Paz Perez-Gonzalez, Jose M. Framinan

Publication date: 30 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle/11441/68459

zbMATH Keywords

heuristicsschedulingtardinessmatheuristicscustomer order

Mathematics Subject Classification ID

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

Related Items (11)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ A matheuristic approach to large-scale avionic scheduling ⋮ Tailoring customer order scheduling search algorithms ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

Uses Software

• Gurobi

Cites Work

• A single machine scheduling problem with two-dimensional vector packing constraints
• A hybrid heuristic approach for single machine scheduling with release times
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• An order scheduling problem with position-based learning effect
• A matheuristic approach for the two-machine total completion time flow shop problem
• Order scheduling in an environment with dedicated resources in parallel
• A note on the complexity of the concurrent open shop problem
• Open shops with jobs overlap
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
• Scheduling orders for multiple product types with due date related objectives
• Coordinated scheduling of customer orders for quick response
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness

This page was built for publication: Order scheduling with tardiness objective: improved approximate solutions