Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
type: Item
instance of: scholarly article
title: Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
zbMATH Open document ID: 1417.90081
DOI: 10.1155/2018/8170294
author: Win-Chin Lin
published in: Discrete Dynamics in Nature and Society
publication date: 2019-02-20T00:00:00Z
review text: Summary: Two-stage production process and its applications appear in many production environments. Job processing times are usually assumed to be constant throughout the process. In fact, the learning effect accrued from repetitive work experiences, which leads to the reduction of actual job processing times, indeed exists in many production environments. However, the issue of learning effect is rarely addressed in solving a two-stage assembly scheduling problem. Motivated by this observation, the author studies a two-stage three-machine assembly flow shop problem with a learning effect based on sum of the processing times of already processed jobs to minimize the makespan criterion. Because this problem is proved to be NP-hard, a branch-and-bound method embedded with some developed dominance propositions and a lower bound is employed to search for optimal solutions. A cloud theory-based simulated annealing (CSA) algorithm and an iterated greedy (IG) algorithm with four different local search methods are used to find near-optimal solutions for small and large number of jobs. The performances of adopted algorithms are subsequently compared through computational experiments and nonparametric statistical analyses, including the Kruskal-Wallis test and a multiple comparison procedure.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7026695
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/8170294
OpenAlex ID: W2804878893
cites work: Single-machine scheduling with learning considerations
cites work: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
cites work: A branch and bound algorithm for the two-stage assembly scheduling problem
cites work: Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
cites work: Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
cites work: A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines
cites work: A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
cites work: Q5437765
cites work: A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
cites work: A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
cites work: A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
cites work: The two-stage assembly scheduling problem to minimize total completion time with setup times
cites work: Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
cites work: A state-of-the-art review on scheduling with learning effects
cites work: Single machine scheduling with learning effect considerations
cites work: Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
cites work: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
cites work: Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
cites work: The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
cites work: Scheduling jobs with position and sum-of-processing-time based processing times
cites work: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
cites work: Assembly-line scheduling with concurrent operations and parallel machines
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3938812
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Optimization by Simulated Annealing
cites work: A survey on optimization metaheuristics
cites work: Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
cites work: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
cites work: The two-machine total completion time flow shop problem
cites work: Note on a single-machine scheduling problem with sum of processing times based learning and ready times
cites work: Nonparametric statistical methods
cites work: The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
cites work: Parallel machine scheduling with general sum of processing time based models
description: scientific article; zbMATH DE number 7026695