Framinan Jose M.

Jose M. Framinan

Information about the author Jose M. Framinan will soon be added to the site.
Found 9 papers in total
A note on ‘A DSS approach to managing customer enquiries for SMEs at the customer level enquiry stage’
A note on ‘A DSS approach to managing customer enquiries for SMEs at the customer level enquiry stage’
2007
In a recent paper, Xiong et al. propose a mixed integer programming model for an ATP...
An adaptive branch and bound approach for transforming job shops into flow shops
An adaptive branch and bound approach for transforming job shops into flow shops
2007
In this paper we address the problem of transforming a job shop layout into a flow...
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
2006
In this paper we consider the no-wait job shop problem with a makespan objective. This...
Comparison of heuristics for flowtime minimisation in permutation flowshops
Comparison of heuristics for flowtime minimisation in permutation flowshops
2005
In this paper, we address the problem of sequencing jobs in a permutation flow shop...
Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
2003
The polynomial heuristic of Nawaz/Enscore/Ham (NEH) is one of the best heuristics to...
Approximative procedures for no-wait job shop scheduling
Approximative procedures for no-wait job shop scheduling
2003
In this article we consider the no-wait job shop problem with makespan objective....
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
2002
In this paper we analyse the performance of flowshop sequencing heuristics with...
Sequencing constant work-in progress (CONWIP) flow-shops: Analysis and heuristics
Sequencing constant work-in progress (CONWIP) flow-shops: Analysis and heuristics
2001
In this paper, we address the backlog sequencing problem in a flow-shop controlled by...
Input control and dispatching rules in a dynamic constant work-in-process flow-shop
Input control and dispatching rules in a dynamic constant work-in-process flow-shop
2000
The purpose of this paper is to study the input control and dispatching rules that...
Papers per page: