Re-entrant flowshop scheduling with learning considerations to minimize the makespan
type: Item
instance of: scholarly article
title: Re-entrant flowshop scheduling with learning considerations to minimize the makespan
zbMATH Open document ID: 1397.90196
author: Chin-Chia Wu
author: Shang-Chia Liu
author: Yu Cheng
author: Shi-Yuan Liu
author: Win-Chin Lin
author: T. C. Edwin Cheng
publication date: 2018-10-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6947911
zbMATH Keywords: makespan
zbMATH Keywords: re-entrant flowshop
zbMATH Keywords: learning effect
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
full work available at URL: s40995-017-0236-7
OpenAlex ID: W2596156679
cites work: Q3964287
cites work: A simulation-based scheduler for flexible flowlines
cites work: Single-machine scheduling with learning considerations
cites work: A state-of-the-art review on scheduling with learning effects
cites work: Single machine scheduling with learning effect considerations
cites work: The two-machine total completion time flow shop problem
cites work: Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
cites work: A note on scheduling on a single processor with speed dependent on a number of executed jobs
cites work: Scheduling problems with learning and ageing effects: a survey
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Optimization by Simulated Annealing
cites work: Single-machine and two-machine flowshop scheduling with general learning functions
cites work: Mean Flow Time Minimization in Reentrant Job Shops with a Hub
cites work: A bi-criterion single-machine scheduling problem with learning considerations
cites work: Note on a single-machine scheduling problem with sum of processing times based learning and ready times
cites work: A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
cites work: Minimizing makespan in re-entrant permutation flow-shops
cites work: Minimizing Makespan in a Class of Reentrant Shops
cites work: Q3820362
cites work: A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
cites work: Some scheduling problems with general position-dependent and time-dependent learning effects
cites work: Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
cites work: Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects''
cites work: Single-machine scheduling problems with a learning effect matrix
DOI: 10.1007/S40995-017-0236-7
published in: Iranian Journal of Science and Technology, Transactions A: Science
description: scientific article; zbMATH DE number 6947911