Scheduling with day shifts and breaks

DOI10.1111/itor.12855OpenAlexW3047824357MaRDI QIDQ6070109

Dehua Xu, Limin Xu, Xian-Yu Yu

Publication date: 20 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12855

zbMATH Keywords

schedulingheuristic algorithmbin packingday shiftnoon break

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Single-machine scheduling with periodic maintenance to minimize makespan
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance
• Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
• Heuristics for the two‐machine scheduling problem with a single server
• A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance
• Two-machine flow shop with synchronized periodic maintenance
• Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
• Combinatorial optimization. Theory and algorithms.
• Multitasking scheduling with multiple rate‐modifying activities
• An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
• A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
• Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating
• A hybrid neural network approach to minimize total completion time on a single batch processing machine
• Efficient algorithms for flexible job shop scheduling with parallel machines

This page was built for publication: Scheduling with day shifts and breaks