Scheduling with day shifts and breaks

Cites Work

Title not available (Why is that?)
Combinatorial optimization. Theory and algorithms.
Single-machine scheduling with periodic maintenance and nonresumable jobs.
Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
Single-machine scheduling with periodic maintenance to minimize makespan
A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance
Multitasking scheduling with multiple rate‐modifying activities
Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance
An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
Heuristics for the two-machine scheduling problem with a single server
Two-machine flow shop with synchronized periodic maintenance
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
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
Efficient algorithms for flexible job shop scheduling with parallel machines
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

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

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