Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Computers and Operations Research
Found
2748 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A branch-and-bound approach to the optimization of redundant software under failure correlation
2002,
Gutjahr Walter J.
A technique for computing optimal redundancy levels for the components of a...
Two-commodity reliability evaluation for a stochastic-flow network with node failure
2002,
Lin Yi-Kuei
This paper considers a stochastic-flow network, in which each node as well as each arc...
Performance analysis of finite buffer discrete-time queue with bulk service
2002,
Gupta U.C.
Discrete-time queues are extensively used in modelling the asynchronous transfer mode...
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
2002,
Allahverdi Ali
The multimedia data objects scheduling problem for WWW applications is modeled using...
Mean value analysis of re-entrant line with batch machines and multi-class jobs
2002,
Kim Sooyoung
We propose an approximate approach for estimating the performance measures of the...
Multi-period job selection: Planning work loads to maximize profit
2002,
Slotnick Susan A.
We examine the profitability of job selection decisions over a number of periods when...
Single machine MAD/Tmax problem with a common due date
2002,
Kim Chae-Bogk
Consider a nonpreemptive single-machine scheduling problem which minimizes the MAD...
Scheduling one-part-type serial manufacturing system under periodic demand: A solvable case
2002,
Lou Sheldon X.C.
The paper studies one-part type, multiple-stage production system with periodic...
The total completion time open shop scheduling problem with a given sequence of jobs on one machine
2002,
Chen Mingchih
This paper addresses the open shop scheduling problem to minimize the total completion...
Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
2002,
Ventura Jose A.
Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots...
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
2002,
Gupta Jatinder N.D.
This paper considers a generalization of the permutation flow shop problem that...
A genetic algorithm to minimize maximum lateness on a batch processing machine
2002,
Uzsoy Reha
We consider the problem of minimizing maximum lateness on a batch processing machine...
A multi-level hybrid framework applied to the general flow-shop scheduling problem
2002,
Jain Anant Singh
Despite the large amount of research conducted in flow-shop scheduling most of it has...
A new approach to quality function deployment planning with financial consideration
2002,
Wang Dingwei
Quality function deployment (QFD) is becoming a widely used customer-oriented approach...
Perturbation heuristics for the pickup and delivery traveling salesman problem
2002,
Laporte Gilbert
This article describes and compares seven perturbation heuristics for the Pickup and...
The period traveling salesman problem: A new heuristic algorithm
2002,
Paletta Giuseppe
A new, simple and effective heuristic algorithm has been developed for the period...
Port partitioning and dynamic queueing for internet protocol forwarding
2002,
Lee Chae Y.
With the increase of internet protocol packets the performance of routers became an...
An algorithm for the determination of optimal cutting patterns
2002,
Georgiadis Michael C.
This paper presents a new mathematical programming formulation for the problem of...
Row and column generation technique for a multistage cutting stock problem
2002,
Zak Eugene J.
This multistage cutting stock problem (CSP) generalizes the one-dimensional CSP when a...
Evaluation of algorithms for one-dimensional cutting
2002,
Gradiar Miro
The paper deals with the prolem of evaluating and comparing different one-dimensional...
A new evolutionary approach to cutting stock problems with and without contiguity
2002,
Newton Charles
Evolutionary algorithms (EAs) have been applied to many optimization problems...
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
2002,
Yanasse Horacio Hideki
The minimization of open stacks problem (MOSP) arises on the sequencing of a set of...
The cable trench problem: Combining the shortest path and minimum spanning tree problems
2002,
Stott Kenneth L.
Let G = (V, E) be a connected graph with specified vertex υ 0 ∈ V , length...
A scenario-based stochastic programming approach for technology and capacity planning
2002,
Tirupati Devanath
In response to market pressures resulting in increased competition, product...
First Page
66
67
68
69
70
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers