Parallel batch scheduling of equal-length jobs with release and due dates
From MaRDI portal
Publication:600846
DOI10.1007/S10951-010-0176-YzbMATH Open1208.90057OpenAlexW2092288295MaRDI QIDQ600846FDOQ600846
Authors: Alessandro Condotta, Sigrid Knust, N. V. Shakhlevich 
Publication date: 3 November 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0176-y
Recommendations
- Scheduling jobs with release dates on parallel batch processing machines
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Scheduling equal-length jobs on identical parallel machines
- Batch scheduling of identical jobs on parallel identical machines
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Batch scheduling with deadlines on parallel machines
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- Scheduling algorithms
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Batching identical jobs
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- NP-complete scheduling problems
- A better algorithm for sequencing with release and delivery times on identical machines
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Minimizing maximum lateness on one machine: computational experience and some applications
Cited In (9)
- Scheduling a proportionate flow shop of batching machines
- Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration
- Scheduling jobs with release dates on parallel batch processing machines
- The lockmaster's problem
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- Theoretical expectation versus practical performance of Jackson's heuristic
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
- Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal
This page was built for publication: Parallel batch scheduling of equal-length jobs with release and due dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600846)
