Formulating a scheduling problem with almost identical jobs by using positional completion times

DOI10.1007/3-540-59408-6_59zbMath1500.90017OpenAlexW1482905080MaRDI QIDQ5101423

Hoogeveen, J. A., Steef L. van de Velde

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_59

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The single-processor scheduling problem with time restrictions: complexity and related problems

Cites Work

• Unnamed Item
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• Dual decomposition of a single-machine scheduling problem
• A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Batching and Scheduling Jobs on Batch and Discrete Processors
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases

This page was built for publication: Formulating a scheduling problem with almost identical jobs by using positional completion times