Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
From MaRDI portal
Publication:3657429
DOI10.1137/0212018zbMath0512.68031OpenAlexW2114451849MaRDI QIDQ3657429
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0212018
Related Items (26)
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem ⋮ Scheduling jobs with equal processing times and time windows on identical parallel machines ⋮ Variants of Multi-resource Scheduling Problems with Equal Processing Times ⋮ Theoretical expectation versus practical performance of Jackson's heuristic ⋮ A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile ⋮ Parallel batch scheduling of equal-length jobs with release and due dates ⋮ Arc-B-consistency of the inter-distance constraint ⋮ On minimizing the weighted number of late jobs in unit execution time open-shops. ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Preemptive scheduling of equal-length jobs in polynomial time ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ A new polynomial algorithm for a parallel identical scheduling problem ⋮ Parallel machine problems with equal processing times: a survey ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ A model for minimizing active processor time ⋮ Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem ⋮ Scheduling multiprocessor tasks for mean flow time criterion ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Ideal schedules in parallel machine settings ⋮ Scheduling equal length jobs with eligibility restrictions ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ On a parallel machine scheduling problem with equal processing times ⋮ Scheduling equal-length jobs on identical parallel machines ⋮ New directions in scheduling theory ⋮ Lower bounds on precedence-constrained scheduling for parallel processors.
This page was built for publication: Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
