Scheduling Jobs on Several Machines with the Job Splitting Property
From MaRDI portal
Recommendations
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Production scheduling problems in a textile industry
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time
Cited in
(28)- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Task splitting for three machine preemptive scheduling
- A fast bipartite network flow algorithm for selective assembly
- Parallel machine scheduling with splitting jobs
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- Scheduling with job-splitting considering learning and the vital-few law
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time
- Scheduling cleaning activities on trains by minimizing idle times
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
- Shop scheduling problems with pliable jobs
- Split scheduling with uniform setup times
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
- An approximate algorithm for the uniform machine scheduling problem with job splitting property
- Resource loading with time windows
- Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem
- Parallel machine scheduling considering a job-splitting property
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
- Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness
- Batch sizing and just-in-time scheduling with common due date
- Lot-sizing scheduling with batch setup times
- Strong LP formulations for scheduling splittable jobs on unrelated machines
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem
This page was built for publication: Scheduling Jobs on Several Machines with the Job Splitting Property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689784)
