Open shop problems with unit time operations
From MaRDI portal
Recommendations
- Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
- scientific article; zbMATH DE number 2109433
- scientific article; zbMATH DE number 894721
- Scheduling unit time open shops to minimize the weighted number of late jobs
- Open shop problem with zero-one time operations and integer release date/deadline intervals
Cites work
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- A New Algorithm for Preemptive Scheduling of Trees
- A Note On The Complexity Of Openshop Scheduling Problems
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Complexity of Scheduling under Precedence Constraints
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- NP-complete scheduling problems
- Optimal Preemptive Scheduling on Two-Processor Systems
- Optimal scheduling for two-processor systems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Scheduling with deadlines and loss functions
- Some simple scheduling algorithms
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
- Two-Processor Scheduling with Start-Times and Deadlines
- Unit Execution Time Shop Problems
Cited in
(24)- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Two-machine shop scheduling with zero and unit processing times
- Scheduling unit time open shops to minimize the weighted number of late jobs
- On complexity of minimizing weighted number of late jobs in unit time open shops
- Minimizing the total completion time in a unit-time open shop with release times
- A branch \(\&\) bound algorithm for the open-shop problem
- Open shop problem with zero-one time operations and integer release date/deadline intervals
- 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
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
- Parameterized complexity of machine scheduling: 15 open problems
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- On the complexity of minimizing the number of late jobs in unit time open shop
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
- Minimizing the weighted number of late jobs in UET open shops
- Open-shop scheduling for unit jobs under precedence constraints
- Scheduling two-machine no-wait open shops to minimize makespan
- Minimizing the sojourn time of open shop scheduling problems with unit-time operations
- Scheduling equal processing time jobs to minimize the weighted number of late jobs
- The complexity of mean flow time scheduling problems with release times
- A new heuristic for open shop total completion time problem
This page was built for publication: Open shop problems with unit time operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031970)
