One-machine generalized precedence constrained scheduling problems
From MaRDI portal
Publication:1342279
The authors investigate one-machine scheduling problems subject to generalized precedence constraints. These constraints specify that for the time between the end of some job and the beginning of another job nonnegative lower and upper bounds are given. The objective is to minimize makespan. For some special cases of the introduced precedence relations complexity investigations are carried out.
Recommendations
Cites work
- Fast Approximation Algorithms for Knapsack Problems
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- One-machine generalized precedence constrained scheduling problems
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
Cited in
(33)- A procedure for the one-machine sequencing problem with dependent jobs
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
- One-machine generalized precedence constrained scheduling problems
- An improved heuristic for one-machine scheduling with delays constraints
- Resource-constrained project scheduling: A survey of recent developments.
- Single-machine scheduling with supporting tasks
- Minimizing flowtime for paired tasks
- Flow shop scheduling problems under machine-dependent precedence constraints
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
- Scheduling with fuzzy delays and fuzzy precedences.
- Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
- Single-machine scheduling with an external resource
- Scheduling periodic I/O access with bi-colored chains: models and algorithms
- Optimizing consolidation processes in hubs: the hub-arrival-departure problem
- Machine scheduling with soft precedence constraints
- Minimum equivalent precedence relation systems
- Job-shop scheduling in a body shop
- A memetic algorithm for the job-shop with time-lags
- Scheduling chains with identical jobs and constant delays on a single machine
- scientific article; zbMATH DE number 5007490 (Why is no real title available?)
- Scatter search with path relinking for the job shop with time lags and setup times
- scientific article; zbMATH DE number 4035555 (Why is no real title available?)
- scientific article; zbMATH DE number 4055356 (Why is no real title available?)
- scientific article; zbMATH DE number 4087409 (Why is no real title available?)
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
- Integer and constraint programming for the offline nanosatellite partition scheduling problem
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- Scheduling coupled-operation jobs with exact time-lags
- Cyclic robot scheduling for 3D printer-based flexible assembly systems
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
This page was built for publication: One-machine generalized precedence constrained scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342279)
