Shop Problems With Two Machines and Time Lags
From MaRDI portal
Recommendations
- Two-machine interval shop scheduling with time lags
- On-line two-machine job shop scheduling with time lags
- Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Time lag size in multiple operations flow shop scheduling heuristics
Cited in
(31)- Time lag size in multiple operations flow shop scheduling heuristics
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Non-bottleneck machines in three-machine flow shops
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Preemptive scheduling on two identical parallel machines with a single transporter
- Complexity results for single-machine problems with positive finish-start time-lags
- Coupled task scheduling with exact delays: literature review and models
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Two-machine flowshop scheduling problem with coupled-operations
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- A memetic algorithm for the job-shop with time-lags
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Two machines flow shop with reentrance and exact time lag
- Climbing discrepancy search for flowshop and jobshop scheduling with time lags
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
- Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions
- Scheduling production tasks in a two-stage FMS
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Scheduling self-suspending tasks: new and old results
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
- Algorithms and Computation
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
- On the complexity of coupled-task scheduling
- Polynomial-time approximation schemes for scheduling problems with time lags
- On the complexity of open shop scheduling with time lags
- Transportation and delivery in flow-shop scheduling problems: a systematic review
- On-line two-machine job shop scheduling with time lags
- Exact method for the two-machine flow-shop problem with time delays
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
This page was built for publication: Shop Problems With Two Machines and Time Lags
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345598)
