makespan minimization problem

31

INFORMATICALT
2006

117views more INFORMATICALT 2006»

Job Sequencing with Exponential Functions of Processing Times

13 years 11 months ago

We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...

Adam Janiak, Mikhail Y. Kovalyov

claim paper

Read More »

44

click to vote

ANOR
2008

171views more ANOR 2008»

A branch and bound method for the job-shop problem with sequence-dependent setup times

13 years 11 months ago

Download hal.archives-ouvertes.fr

This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...

Christian Artigues, Dominique Feillet

claim paper

Read More »

30

click to vote

CDC
2008
IEEE

113views Control Systems» more CDC 2008»

Model reduction for a class of input-quantized systems in the max-plus algebra

14 years 6 months ago

Download idealabs.byu.edu

Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the ﬂow shop with �...

Whitney Weyerman, Sean Warnick

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers