Sciweavers

388 search results - page 7 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
4OR
2006
99views more  4OR 2006»
13 years 8 months ago
A decomposition-based solution method for stochastic mixed integer nonlinear programs
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
Maria Elena Bruni
EOR
2010
104views more  EOR 2010»
13 years 6 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
SIAMJO
2002
89views more  SIAMJO 2002»
13 years 8 months ago
A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
Stephen C. Billups, Layne T. Watson
CCE
2008
13 years 8 months ago
Scheduling of a mixed batch/continuous sugar milling plant using Petri nets
Scheduling of processes in mixed batch/continuous plants, due to their hybrid nature can become very complex. This paper presents the Timed Hybrid Petri net (THPN) as a suitable t...
Mahsa Ghaeli, Parisa A. Bahri, Peter L. Lee
IFIP12
2004
13 years 10 months ago
A Decision Support System (DSS) for the Railway Scheduling Problem
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
Laura Paola Ingolotti, María Pilar Tormos, ...