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

DOI10.1007/3-540-59408-6_59MaRDI QIDQ5101423zbMATH OpenOpenAlexFDO

Authors Han Hoogeveen, Steef 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)

Recommendations

• Scheduling problems with position dependent job processing times: computational complexity results
• Time-of-use scheduling problem with equal-length jobs
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
• Approximability of scheduling with fixed jobs
• Equivalent time-dependent scheduling problems
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
• Scheduling jobs of equal length: complexity, facets and computational results
• Scheduling jobs of equal length: Complexity, facets and computational results
• Scheduling identical jobs and due-window on uniform machines
• Approximation algorithms for some position-dependent scheduling problems

Cites work

• A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Dual decomposition of a single-machine scheduling problem
• scientific article; zbMATH DE number 47677 (Why is no real title available?)
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems

Cited in

(2)

• The single-processor scheduling problem with time restrictions: complexity and related problems
• A scheduling problem with job values given as a power function of their completion times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101423)