A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
type: Item
instance of: scholarly article
title: A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
zbMATH Open document ID: 1252.90028
author: Chin-Chia Wu
author: Wen-Hung Wu
author: Peng-Hsiang Hsu
author: Kunjung Lai
published in: Applied Mathematical Modelling
publication date: 2012-12-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6114316
zbMATH Keywords: scheduling
zbMATH Keywords: two-machine
zbMATH Keywords: genetic algorithm
zbMATH Keywords: truncated learning function
MaRDI profile type: Publication
full work available at URL: j.apm.2011.12.038
OpenAlex ID: W2077798145
cites work: Q3525911
cites work: Single-machine scheduling with learning considerations
cites work: Single machine scheduling with learning effect considerations
cites work: Scheduling jobs with position-dependent processing times
cites work: Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
cites work: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
cites work: Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
cites work: Some scheduling problems with general position-dependent and time-dependent learning effects
cites work: Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
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: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
cites work: Single-machine and two-machine flowshop scheduling with general learning functions
cites work: A new approach to the learning effect: Beyond the learning curve restrictions
cites work: A state-of-the-art review on scheduling with learning effects
cites work: Flow-shop scheduling with a learning effect
cites work: A bicriteria flowshop scheduling with a learning effect
cites work: A note on the total completion time problem in a permutation flowshop with a learning effect
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Two-machine flowshop scheduling to minimize mean flow time
cites work: The two-machine total completion time flow shop problem
cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
cites work: An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
cites work: An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
cites work: Improved genetic algorithm for the permutation flowshop scheduling problem.
cites work: Q4079017
cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
cites work: A genetic algorithm for flow shop scheduling problems
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
DOI: 10.1016/J.APM.2011.12.038
description: scientific article; zbMATH DE number 6114316