Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
From MaRDI portal
(Redirected from Publication:1615940)
Recommendations
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
Cites work
- A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- A memetic algorithm for the job-shop with time-lags
- Benchmarks for basic scheduling problems
- Benchmarks for shop scheduling problems
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- Genetic algorithms for the two-stage bicriteria flowshop problem
- scientific article; zbMATH DE number 900396 (Why is no real title available?)
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Local search heuristics for two-stage flow shop problems with secondary criterion
- Multicriteria scheduling problems: a survey
- Multiple and bicriteria scheduling: A literature survey
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Permutation vs. non-permutation flow shop schedules
- Scatter search with path relinking for the job shop with time lags and setup times
- Shop Problems With Two Machines and Time Lags
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- Two-machine flow shop scheduling problems with minimal and maximal delays
- Two-machine flowshop scheduling with a secondary criterion
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
Cited in
(10)- Time lag size in multiple operations flow shop scheduling heuristics
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- Transportation and delivery in flow-shop scheduling problems: a systematic review
- Parallel shifting bottleneck algorithms for non-permutation flow shop scheduling
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Exact method for the two-machine flow-shop problem with time delays
This page was built for publication: Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1615940)
