Scheduling with job-splitting considering learning and the vital-few law
type: Item
instance of: scholarly article
title: Scheduling with job-splitting considering learning and the vital-few law
zbMATH Open document ID: 1391.90285
author: Chenjie Wang
author: Zhi-Hai Zhang
author: Li Zheng
author: Chein-Shan Liu
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6901543
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: makespan
zbMATH Keywords: job splitting
zbMATH Keywords: learning effect
zbMATH Keywords: vital-few law
zbMATH Keywords: worst-case analysis
MaRDI profile type: Publication
full work available at URL: j.cor.2017.02.011
OpenAlex ID: W2588562396
cites work: Single-machine scheduling with learning considerations
cites work: A state-of-the-art review on scheduling with learning effects
cites work: Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position
cites work: A state-of-the-art review of parallel-machine scheduling research
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Single-machine scheduling problems with past-sequence-dependent setup times
cites work: Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
cites work: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
cites work: Solving a two-agent single-machine scheduling problem considering learning effect
cites work: Scheduling problems with a learning effect
cites work: The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
cites work: Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models
cites work: Scheduling Jobs on Several Machines with the Job Splitting Property
cites work: A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
cites work: Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
cites work: Several flow shop scheduling problems with truncated position-based learning effect
cites work: Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
cites work: Parallel machine scheduling with splitting jobs
DOI: 10.1016/J.COR.2017.02.011
Recommended article: Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect
Recommended article: Scheduling jobs with a general learning effect model
Recommended article: Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
Recommended article: Scheduling jobs with general truncated learning effects including proportional setup times
Recommended article: Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
Recommended article: Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position
Recommended article: Note on scheduling with general learning curves to minimize the number of tardy jobs
Recommended article: Resource constrained scheduling with general truncated job-dependent learning effect
Recommended article: Scheduling problems with a learning effect
Recommended article: Q2948893
description: scientific article; zbMATH DE number 6901543