General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
DOI10.1016/J.INS.2013.06.025zbMATH Open1321.90064OpenAlexW2062923083MaRDI QIDQ497626FDOQ497626
Authors: Mohsen Ziaee 
Publication date: 24 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.06.025
Recommendations
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- Heuristics for the flow line problem with setup costs
- A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
- A bicriteria scheduling with sequence-dependent setup times
heuristicschedulingtotal weighted tardinesssequence-dependent setup timesgeneral flowshop scheduling problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A survey of scheduling problems with setup times or costs
- Title not available (Why is that?)
- Benchmarks for basic scheduling problems
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
- Permutation vs. non-permutation flow shop schedules
- A new constructive heuristic for the flowshop scheduling problem
- Heuristics for the flow line problem with setup costs
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
Cited In (16)
- Title not available (Why is that?)
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- The third comprehensive survey on scheduling problems with setup times/costs
- Total flow time minimization in a flowshop sequence-dependent group scheduling problem
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times
- Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry)
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
This page was built for publication: General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497626)
