Keyword: programming: integer

Found 3058 papers in total
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers
2002,
The paper presents a mixed integer programming approach for makespan minimization in...
A branch-and-bound algorithm for the inference of ancestral amino–acid sequences when the replacement rate varies among sites: Application to the evolution of five gene families
A branch-and-bound algorithm for the inference of ancestral amino–acid sequences when the replacement rate varies among sites: Application to the evolution of five gene families
2002,
Motivation: We developed an algorithm to reconstruct ancestral sequences, taking into...
An integer programming approach to the subway daily crew scheduling problem
An integer programming approach to the subway daily crew scheduling problem
2002,
This paper considers subway crew scheduling problem. Crew scheduling is concerned with...
Arterial-based control of traffic flow in urban grid networks
Arterial-based control of traffic flow in urban grid networks
2002,
Urban networks are typically composed of a grid of arterial streets. Optimal control...
Facility location model for booster disinfection of water supply networks
Facility location model for booster disinfection of water supply networks
2002,
Secondary or postdisinfection is widely used to maintain protective levels of...
Optimal operation of a potable water distribution network
Optimal operation of a potable water distribution network
2002,
This paper presents an approach to an optimal operation of a potable water...
Combined multi-criteria decision aid and integer programming approach for project selection in the electricity market
Combined multi-criteria decision aid and integer programming approach for project selection in the electricity market
2003,
The European policy target of substantially increasing the share of renewable energy...
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
2003,
We present a branch-and-cut algorithm to solve the single-commodity, uncapacitated,...
Mixed Integer Programming-based heuristics for capacitated lotsizing problems
Mixed Integer Programming-based heuristics for capacitated lotsizing problems
2003,
The complexity of capacitated lotsizing problems is well known. The introduction of...
A mixed integer linear programming model for set-up reduction superstructures
A mixed integer linear programming model for set-up reduction superstructures
2003,
The objective of this research is to introduce the concept of a set-up reduction...
Multiperiod production planning carrying over set-up time
Multiperiod production planning carrying over set-up time
2003,
Set-ups eat production capacity time and continue troubling production planning,...
BASF uses a framework for developing web-based production-planning-optimization tools
BASF uses a framework for developing web-based production-planning-optimization tools
2002,
We developed a computational framework for delivering practical...
A model for batch advanced available-to-promise
A model for batch advanced available-to-promise
2002,
The available-to-promise ( ATP ) function is becoming increasingly important in supply...
Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
2003,
The machine scheduling literature does not consider the issue of tool change. The...
A branch-and-price algorithm for a hierarchical crew scheduling problem
A branch-and-price algorithm for a hierarchical crew scheduling problem
2002,
We describe a real-life problem arising at a crane rental company. This problem is a...
Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
2003,
This paper tackles the general single machine scheduling problem, where jobs have...
Scheduling patients in an ambulatory surgical center
Scheduling patients in an ambulatory surgical center
2003,
This paper presents a deterministic approach to schedule patients in an ambulatory...
Scheduling prowler training
Scheduling prowler training
2003,
The US Navy Prowler aircraft is designed for electronic surveillance and...
An airspace planning model for selecting flight-plans under workload, safety, and equity considerations
An airspace planning model for selecting flight-plans under workload, safety, and equity considerations
2002,
In this paper, we present an airspace planning model (APM) that has been developed for...
A mixed integer knapsack model for allocating funds to highway safety improvements
A mixed integer knapsack model for allocating funds to highway safety improvements
2002,
This paper presents a methodology for allocating funds to highway safety improvements....
Robust ship scheduling with multiple time windows
Robust ship scheduling with multiple time windows
2002,
We present a ship scheduling problem concerned with the pickup and delivery of bulk...
An airspace planning model for selecting flight-plans under workload, safety, and equity considerations
An airspace planning model for selecting flight-plans under workload, safety, and equity considerations
2002,
In this paper, we present an airspace planning model (APM) that has been developed for...
Minimizing the average query complexity of learning monotone Boolean functions
Minimizing the average query complexity of learning monotone Boolean functions
2002,
This paper addresses the problem of completely reconstructing deterministic monotone...
Extending an algebraic modeling language to support constraint programming
Extending an algebraic modeling language to support constraint programming
2002,
Although algebraic modeling languages are widely used in linear and nonlinear...
Papers per page: