Scheduling jobs with equal processing times and time windows on identical parallel machines
From MaRDI portal
Publication:835604
DOI10.1007/s10951-008-0063-yzbMath1168.90426MaRDI QIDQ835604
Svetlana A. Kravchenko, Peter Brucker
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0063-y
90B35: Deterministic scheduling theory in operations research
Related Items
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation, Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, Single machine scheduling with two competing agents and equal job processing times, Optimal restricted due date assignment in scheduling, Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility, Scheduling problem with multi-purpose parallel machines, Scheduling with multiple servers, Finding total unimodularity in optimization problems solved by linear programs, Scheduling jobs with equal processing times subject to machine eligibility constraints, Fast LP models and algorithms for identical jobs on uniform parallel machines, Two-agent scheduling on uniform parallel machines with min-max criteria, A decomposition scheme for single stage scheduling problems, On a parallel machine scheduling problem with equal processing times, Minimizing the number of machines for scheduling jobs with equal processing times, Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal, A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria, Matching supply and demand in a sharing economy: classification, computational complexity, and application, Scheduling equal length jobs with eligibility restrictions, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, Parallel machine problems with equal processing times: a survey, Scheduling two agents on uniform parallel machines with~makespan and cost functions, Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times, Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
Cites Work
