Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
From MaRDI portal
Publication:6657881
DOI10.1007/s10951-024-00814-zMaRDI QIDQ6657881
Udo Buscher, Janis S. Neufeld, Julius Hoffmann
Publication date: 7 January 2025
Published in: Journal of Scheduling (Search for Journal in Brave)
machine schedulingearliness-tardinessmetaheuristicsiterated greedy algorithmdedicated machinescustomer order scheduling
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- An order scheduling problem with position-based learning effect
- Order scheduling in an environment with dedicated resources in parallel
- A note on the complexity of the concurrent open shop problem
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
- 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
- Metaheuristics for order scheduling problem with unequal ready times
- Order scheduling with tardiness objective: improved approximate solutions
- Scheduling job classes on uniform machines
- A multi-agent system for the weighted earliness tardiness parallel machine problem
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
This page was built for publication: Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
