Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
From MaRDI portal
Publication:1727266
DOI10.1155/2018/8170294zbMath1417.90081OpenAlexW2804878893MaRDI QIDQ1727266
Publication date: 20 February 2019
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/8170294
Related Items (2)
Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- A survey on optimization metaheuristics
- Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
- A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
- The two-stage assembly scheduling problem to minimize total completion time with setup times
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- The two-machine total completion time flow shop problem
- A branch and bound algorithm for the two-stage assembly scheduling problem
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Note on a single-machine scheduling problem with sum of processing times based learning and ready times
- Parallel machine scheduling with general sum of processing time based models
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
- Scheduling jobs with position and sum-of-processing-time based processing times
- A state-of-the-art review on scheduling with learning effects
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- Optimal two- and three-stage production schedules with setup times included
- Assembly-Line Scheduling with Concurrent Operations and Parallel Machines
- Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Single machine scheduling with learning effect considerations
This page was built for publication: Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
