Proportionate flowshops with general position-dependent processing times

Authors:
Gur Mosheiov
Affiliations:
School of Business Administration, The Hebrew University, Jerusalem 91905, Israel
Venue:
Information Processing Letters
Year:
2011

Citing 4
Cited 3

Algorithms for two bottleneck optimization problems

Journal of Algorithms
The learning effect: Getting to the core of the problem

Information Processing Letters
Job Sequencing with Exponential Functions of Processing Times

Informatica
Solution algorithms for the makespan minimization problem with the general learning model

Computers and Industrial Engineering

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

Computers and Operations Research
A short note on "Proportionate flowshops with general position-dependent processing times"

Information Processing Letters
Several flow shop scheduling problems with truncated position-based learning effect

Computers and Operations Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

Most scheduling studies assume constant (position-independent) job processing times. Most of the papers allowing position-dependent processing times consider only special cases, where the job processing times follow a specific function of the job-position. Polynomial time solutions have hardly been found for general position-dependent processing times in scheduling literature. In this note we provide one of these cases: we introduce a polynomial time solution for minimum makespan on an m-machine proportionate flowshop.