Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: combinatorial optimization
Found
3184 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Capacitated replenishment and disposal planning for multiple products with resalable returns
2013,
Karakayali I
We consider a replenishment and disposal planning problem (RDPP) that arises in...
Data mining‐based dispatching system for solving the local pickup and delivery problem
2013,
Shi Leyuan
The Local Pickup and Delivery Problem (LPDP) has drawn much attention, and...
A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines
2013,
Morrice Douglas
This paper introduces a new model and solution methodology for a real‐world...
Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
2013,
Liang Zhe
This paper addresses a dual multicast routing problem with shared risk link group...
A particle swarm optimization for solving lot‐sizing problem with fluctuating demand and preservation technology cost under trade credit
2013,
Dye Chung-Yuan
In this paper, we consider the effect of preservation technology cost investing on...
Online capacity maximization in wireless networks
2013,
Hoefer Martin
In this paper we study a dynamic version of capacity maximization in the physical...
Single machine batch scheduling with release times and delivery costs
2013,
Steiner George
We study single machine batch scheduling with release times. Our goal is to minimize...
Exact algorithms for inventory constrained scheduling on a single machine
2013,
Pesch Erwin
This paper focuses on single machine scheduling subject to inventory constraints. Jobs...
Flexible weekly tour scheduling for postal service workers using a branch and price
2013,
Bard Jonathan
This paper addresses the problem of flexible shift scheduling of service employees at...
Fast minimum float computation in activity networks under interval uncertainty
2013,
Artigues Christian
This paper concerns project scheduling under uncertainty. The project is modeled as an...
Mixed‐integer linear programming models for batch sterilization of packaged‐foods plants
2013,
Simpson R
Batch sterilization with individual retorts is a common mode of operation in many...
Real‐time integrated prefetching and caching
2013,
Sanders Peter
The high latencies for access to background memory like hard disks or flash memory can...
Scheduling satellite launch missions: an MILP approach
2013,
Brandimarte Paolo
The paper deals with an MILP model to schedule satellite launches with alternative...
Optimising Waiting at Nodes in Time‐Dependent Networks: Cost Functions and Applications
2013,
Vitetta Antonino
In this paper, the relationship between waiting at nodes and the path cost in a...
A note on proving the strong NP‐hardness of a scheduling problem with position dependent job processing times
2013,
Rudek Radoslaw
In this paper, we show that the strong NP‐hardness proof of the single machine...
Integrated planning of loaded and empty container movements
2013,
Caris An
Efficiently planning drayage operations is an important task for transportation...
Air cargo scheduling: integrated models and solution procedures
2013,
Derigs Ulrich
Designing a profitable flight schedule is a highly complex planning problem. Both...
Simultaneous berth allocation and yard planning at tactical level
2013,
Hendriks M
We present a simultaneous berth allocation and yard planning problem at tactical...
Flexible space‐sharing strategy for storage yard management in a transshipment hub port
2013,
Chew Ek
In this paper, a storage yard planning problem is studied for a transshipment port...
Truck scheduling in cross‐docking terminals with fixed outbound departures
2013,
Boysen Nils
At a cross‐docking terminal, inbound shipments are directly transshipped across...
A study on coordination of capacity allocation for different types of contractual retailers
2013,
Huang Yeu-Shiang
Because the demand is uncertain and it is impossible to expand capacity immediately,...
Algorithmic determination of the maximum possible earnings for investment strategies
2013,
Brandouy Olivier
This paper proposes a new method for determining the upper bound of any investment...
Les problèmes d'ordonnancement de type flow‐shop hybride :état de l'art
1999,
Vignier A
A special class of scheduling problems is studied in this paper, named Hybrid...
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
1999,
Levy M-L
We propose a temporal decomposition approach for the one‐machine scheduling...
First Page
79
80
81
82
83
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers