Can I read Lower Bounds and Algorithms for Flowtime Minimization on a Single Machine with Set-up Times on EtoBox?

Lower Bounds and Algorithms for Flowtime Minimization on a Single Machine with Set-up Times by Simon Dunstall; Andrew Wirth; Kenneth Baker is a Engineering article available to read on EtoBox.

What is Lower Bounds and Algorithms for Flowtime Minimization on a Single Machine with Set-up Times about?

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this set-up being the sequence-independent set-up time s j for family j. We propose lower bounds for the problem of minimizing the weighted owtime on a single machine with family set-up times and static job availability. These lower bounds are incorporated into a branch-and-bound algorithm which can e ciently solve instances with up to 70 jobs.

Who reads Lower Bounds and Algorithms for Flowtime Minimization on a Single Machine with Set-up Times?

Author

Simon Dunstall; Andrew Wirth; Kenneth Baker

Publisher

Springer US; Springer-Verlag; Kluwer Academic Publishers; Springer Science and Business Media LLC; Wiley (ISSN 1094-6136)

Published

2000

Language

EN

Field

Engineering (Physical Sciences)