Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: combinatorial analysis
Found
435 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A combinatorial auction with multiple winners for universal service
2000,
Steinberg Richard
We describe a discrete-time auction procedure called PAUSE (Progressive Adaptive User...
Erratum to ‘The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability’ [EJOR 124 (3) (2000) 511–528]
2000,
Jahnke Hermann
Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases
2000,
Kogan Konstantin
The paper analyzes a manufacturing system made up of one workstation which is able to...
Optimal assignment of high multiplicity flight plans to dispatchers
2000,
Agnetis A.
This paper addresses the problem of finding a feasible schedule of n jobs on m...
A comparative numerical analysis for the guillotine two-dimensional cutting problem
2000,
Gmes Arlindo
In this work, the behavior of four algorithms in the resolution of the two-dimensional...
The 3D-packing by Meta Data Structure and packing heuristics
2000,
Kajitani Yoji
The three dimensional (3D) packing problem is to arrange given rectangular boxes in a...
Forest management models and combinatorial algorithms: Analysis of state of the art
2000,
Guignard Monique
Linear Programming and Mixed Integer Linear Programs have been used for forest...
Two-machine flowshop group scheduling problem
2000,
Chern Maw-Sheng
This paper considers a two-machine flowshop group scheduling problem. The jobs are...
A constrained minimum spanning tree problem
2000,
Zhang Guochuan
In this paper, we give an O(n 2 ) algorithm for finding a point on a given line l...
The method of generalized generating sequences
2000,
Ushakov Igor
The method of generalized generating sequences is based on some modifications of the...
Calculation of stability radii for combinatorial optimization problems
1998,
Wagelmans A.P.M.
We present algorithms to calculate the stability radius of optimal or approximate...
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
1999,
Chudak Fabin A.
We consider the problem of minimizing the sum of weighted completion times of jobs...
Assignment of program modules to processors: A simulated annealing approach
2000,
Hindi Khalil S.
A simulated annealing approach to the assignment of program modules to processors in a...
The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
2000,
Brggemann Wolfgang
The discrete lot-sizing and scheduling problem (DLSP) has been suggested for the...
Heuristic and exact algorithms for the simultaneous assignment problem
2000,
Yamada Takeo
The simultaneous assignment problem is formulated as an extension to the assignment...
Cliques and clustering: A combinatorial approach
1998,
Trick Michael A.
We use column generation and a specialized branching technique for solving constrained...
Complexity of mixed shop scheduling problems: A survey
2000,
Werner Frank
We survey recent results on the computational complexity of mixed shop scheduling...
Scheduling jobs and maintenance activities on parallel machines
2000,
Lee Chung-Yee
Most machine scheduling models assume that the machines are available all of the time....
Scheduling for parallel dedicated machines with a single server
2000,
Strusevich Vitaly A.
This paper examines scheduling problems in which the setup phase of each operation...
The distributed program reliability analysis on star topologies
2000,
Chen Deng-Jyi
A distributed computing system consists of processing elements, communication links,...
Principles of combinatorial optimization applied to container-ship stowage planning
1999,
Wilson I.D.
In this paper, a methodology for generating automated solutions to the container...
Applying geographical information systems and combinatorial optimization to fiber deployment plans
1999,
Cao B.Y.
A decision-support system for the Fiber Deployment Plan problem is developed for the...
Layout of facilities using an ant system approach
2000,
Bland J.A.
In this paper the layout of facilities is investigated using a heuristic combinatorial...
Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism
1999,
Tian Peng
Focusing on the generation mechanism of random permutation solutions, this paper...
First Page
7
8
9
10
11
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers