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

Authors:
Gur Mosheiov;Daniel Oron
Affiliations:
School of Business Administration, The Hebrew University, Jerusalem 91905, Israel;Business School, The University of Sydney, NSW 2006, Australia
Venue:
Computers and Operations Research
Year:
2012

Citing 4
Cited 2

A competitive (dual) simplex method for the assignment problem

Mathematical Programming: Series A and B
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Proportionate flowshops with general position-dependent processing times

Information Processing Letters
Scheduling shops to minimize the weighted number of late jobs

Operations Research Letters

Makespan minimization flowshop with position dependent job processing times-computational complexity and solution algorithms

Computers and Operations Research
Several flow shop scheduling problems with truncated position-based learning effect

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In various real life scheduling systems job processing times vary according to the number of jobs previously processed. The vast majority of studies assume a restrictive functional form to describe job processing times. In this note, we address a scheduling problem with the most general job processing time functions. The machine setting assumed is an m-machine proportionate flowshop, and the objective function is minimum number of tardy jobs. We show that the problem can be formulated as a bottleneck assignment problem with a maximum cardinality constraint. An efficient polynomial time (O(n^4logn)) solution is introduced.