The one machine scheduling problem: insertion of a job under the real-time constraint

DOI10.1016/j.ejor.2007.09.048zbMath1176.90206OpenAlexW2093589119MaRDI QIDQ1042209

J. Blot

Publication date: 7 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.09.048

zbMATH Keywords

schedulingsingle machinereal-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date ⋮ A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors ⋮ Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain

Cites Work

• Modelling for the control of a complex radar system
• On-line scheduling in a surface treatment system
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• On-Line Scheduling In Assembly Processes
• Single machine scheduling with release times, deadlines and tardiness objectives
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• Unnamed Item
• Unnamed Item

This page was built for publication: The one machine scheduling problem: insertion of a job under the real-time constraint