Solving constrained flow-shop scheduling problems with three machines
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3848955
- Heuristic approach for \(N\)-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs
- scientific article; zbMATH DE number 3848956
- scientific article; zbMATH DE number 3862915
- Constrained multi-stage flowshop scheduling including transportation time and weights of jobs with break-down interval having job block criteria, the processing time associated with their respective probabilities
Cited in
(13)- Three-machine flow shop scheduling with overlapping waiting time constraints
- Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates
- Heuristic approach for \(N\)-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs
- Exact solution of the two-machine flow shop problem with three operations
- Makespan minimization on three-machine flow shop with deteriorating jobs
- scientific article; zbMATH DE number 3843477 (Why is no real title available?)
- scientific article; zbMATH DE number 3848955 (Why is no real title available?)
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- scientific article; zbMATH DE number 3980892 (Why is no real title available?)
- Optimal scheduling of the 3-machine assembly-type flow shop
- Scheduling of flow shop problems on 3 machines in fuzzy environment with double transport facility
- A three-agent scheduling problem for minimizing the flow time on two machines
- Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times
This page was built for publication: Solving constrained flow-shop scheduling problems with three machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072696)
