Solving the single-machine scheduling problem with periodical resource constraints

DOI10.1007/S10100-025-01003-9MaRDI QIDQ6857291zbMATH OpenFDO

Authors Maja Ristić

Publication date 17 February 2026

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10100-025-01003-9

zbMATH Keywords

combinatorial optimizationschedulingsingle machinevariable neighborhood search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A single machine scheduling problem with availability constraints and sequence-dependent setup costs
• Gaussian variable neighborhood search for continuous optimization
• Gaussian variable neighborhood search for the file transfer scheduling problem
• Handbook of metaheuristics
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
• Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
• On Multidimensional Packing Problems
• On single machine scheduling with resource constraint
• On the minimum number of resources for a perfect schedule
• Resource constrained scheduling as generalized bin packing
• Scheduling the maintenance on a single machine
• Single machine flow-time scheduling with scheduled maintenance
• Single machine scheduling problems with financial resource constraints: some complexity results and properties
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• Single-machine scheduling with periodic maintenance to minimize makespan
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Statistical comparisons of classifiers over multiple data sets
• The third comprehensive survey on scheduling problems with setup times/costs
• Variable neighborhood search
• Variable neighborhood search: basics and variants

This page was built for publication: Solving the single-machine scheduling problem with periodical resource constraints

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