Scheduling Jobs on Several Machines with the Job Splitting Property
From MaRDI portal
Publication:5689784
DOI10.1287/opre.44.4.617zbMath0865.90081OpenAlexW2159580476MaRDI QIDQ5689784
Publication date: 6 July 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.44.4.617
Related Items
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows, Resource loading with time windows, Scheduling with job-splitting considering learning and the vital-few law, Lot-sizing scheduling with batch setup times, Dispatching problems for parallel machines in the TFT‐LCD assembly process, Strong LP formulations for scheduling splittable jobs on unrelated machines, A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones, Splitting versus setup trade-offs for scheduling to minimize weighted completion time, 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, Scheduling cleaning activities on trains by minimizing idle times, Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem, 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, 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, Parallel machine scheduling considering a job-splitting property, Network flow approaches to pre-emptive open-shop scheduling problems with time-windows, An approximate algorithm for a high-multiplicity parallel machine scheduling problem, Shop scheduling problems with pliable jobs, Batch sizing and just-in-time scheduling with common due date, A fast bipartite network flow algorithm for selective assembly, Parallel machine scheduling with splitting jobs, Exact and approximate algorithms for high-multiplicity parallel machine scheduling, An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
