Scheduling jobs with equal processing times and time windows on identical parallel machines
From MaRDI portal
Publication:835604
Recommendations
- Scheduling equal-length jobs on identical parallel machines
- Scheduling problems on parallel identical unbounded batch processing machines
- Scheduling identical jobs on uniform parallel machines
- Minimizing the number of machines for scheduling jobs with equal processing times
- Equal processing time bicriteria scheduling on parallel machines
Cites work
Cited in
(34)- Scheduling jobs within time windows on identical parallel machines: New model and algorithms
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Finding total unimodularity in optimization problems solved by linear programs
- Scheduling problem with multi-purpose parallel machines
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
- Scheduling Equal-Length Jobs with Delivery times on Identical Processors
- scientific article; zbMATH DE number 1530325 (Why is no real title available?)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A decomposition scheme for single stage scheduling problems
- Parallel machine problems with equal processing times: a survey
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Single machine scheduling with two competing agents and equal job processing times
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
- On a parallel machine scheduling problem with equal processing times
- Scheduling identical jobs on uniform parallel machines
- Two-agent scheduling on uniform parallel machines with min-max criteria
- A better algorithm for sequencing with release and delivery times on identical machines
- Fast LP models and algorithms for identical jobs on uniform parallel machines
- Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
- Scheduling jobs with equal processing times and a single server on parallel identical machines
- Scheduling jobs with normally distributed processing times on parallel machines
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
- Scheduling equal-length jobs on identical parallel machines
- Equal processing time bicriteria scheduling on parallel machines
- Optimal restricted due date assignment in scheduling
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling with multiple servers
- Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal
- Minimizing the number of machines for scheduling jobs with equal processing times
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
- Scheduling equal length jobs with eligibility restrictions
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
This page was built for publication: Scheduling jobs with equal processing times and time windows on identical parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835604)
