The following pages link to Jose M. Framinan (Q300035):
Displayed 47 items.
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- The effect of inventory record inaccuracy in information exchange supply chains (Q319034) (← links)
- On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Architecture of manufacturing scheduling systems: literature review and an integrated proposal (Q976436) (← links)
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070) (← links)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
- On the bullwhip avoidance phase: the synchronised supply chain (Q1926819) (← links)
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- The impact of the supply chain structure on bullwhip effect (Q2285887) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)
- A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449) (← links)
- Sequencing CONWIP flow-shops: Analysis and heuristics (Q4674420) (← links)
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective (Q4678194) (← links)
- Input control and dispatching rules in a dynamic CONWIP flow-shop (Q4706244) (← links)
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem (Q4706278) (← links)
- Manufacturing Scheduling Systems (Q5402231) (← links)
- On the link between inventory and responsiveness in multi-product supply chains (Q5402754) (← links)
- An IT-enabled supply chain model: a simulation study (Q5499837) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
- A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
- An overview on the use of operations research in additive manufacturing (Q6099430) (← links)