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 single‐machine, single‐wafer‐processing, multiple‐lots‐per‐carrier scheduling problem to minimize the sum of lot completion times
2012,
Sarin Subhash C
A high volume/high mix wafer fabrication facility processes customer orders (or lots)...
Development of a fuel consumption optimization model for the capacitated vehicle routing problem
2012,
Xiao Yiyong
Fuel consumption accounts for a large and increasing part of transportation costs. In...
Synchronized arc routing for snow plowing operations
2012,
Laporte Gilbert
This paper introduces a synchronized arc routing problem for snow plowing operations....
Transmitter location for maximum coverage and constructive–destructive interference management
2012,
Marianov Vladimir
Covering location models consider a demand ‘covered’ if there is at least...
A Self‐guided Genetic Algorithm for permutation flowshop scheduling problems
2012,
Chang Pei-Chann
In this paper we develop a Self‐guided Genetic Algorithm (Self‐guided...
Unrelated parallel‐machine scheduling with aging effects and multi‐maintenance activities
2012,
Yang Dar-Li
Machine maintenance is often performed in manufacturing to prevent premature machine...
Single‐Source Capacitated Multi‐Facility Weber Problem–An iterative two phase heuristic algorithm
2012,
Torabi S A
Multi‐Facility Weber Problem (MFWP), also known as continuous...
An adaptive tabu search approach for buffer allocation problem in unreliable non‐homogenous production lines
2012,
Tunali Semra
The buffer allocation problem, i.e. how much buffer storage to allow and where to...
New constructive algorithms for leather nesting in the automotive industry
2012,
Alves Cludio
In this paper, we address one of the hardest two‐dimensional cutting stock...
A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
2012,
Oguz Ceyda
This paper deals with the single machine scheduling problem to minimize the total...
A dynamic programming approach to solving the assortment planning problem with multiple quality levels
2012,
Mayorga Maria E
While the assortment planning problem, in which a firm selects a set of products to...
Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks
2012,
Aras Necati
Sensors are tiny electronic devices having limited battery energy and capability for...
Exact algorithms for OWA‐optimization in multiobjective spanning tree problems
2012,
Spanjaard Olivier
This paper deals with the multiobjective version of the optimal spanning tree problem....
Solving the stochastic dynamic lot‐sizing problem through nature‐inspired heuristics
2012,
Skouri K
We investigate the dynamic lot‐size problem under stochastic and...
The effect of the asymmetry of road transportation networks on the traveling salesman problem
2012,
Ruiz Rubn
The routing of vehicles on road transportation networks is an area of great importance...
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
2012,
Lorena Luiz Antonio Nogueira
This paper presents a new alternative of Lagrangian decomposition based on column...
The bi‐objective stochastic covering tour problem
2012,
Gutjahr Walter J
We formulate a bi‐objective covering tour model with stochastic demand where...
An effective heuristic algorithm for sum coloring of graphs
2012,
Wu Qinghua
Given an undirected graph G = ( V , E ) , the minimum sum coloring problem (MSCP) is...
Minimizing the number of tardy jobs on a proportionate flowshop with general position‐dependent processing times
2012,
Mosheiov Gur
In various real life scheduling systems job processing times vary according to the...
Mathematical models for preemptive shop scheduling problems
2012,
Moslehi Ghasem
More than half a century has passed since Bowman and Dantzig (1959) introduced their...
Design, engineering, and experimental analysis of a simulated annealing approach to the post‐enrolment course timetabling problem
2012,
Schaerf Andrea
The post‐enrolment course timetabling (PE‐CTT) is one of the most...
An aggregation heuristic for large scale p‐median problem
2012,
Avella Pasquale
The p ‐median problem (PMP) consists of locating p facilities (medians) in...
Measuring and maximizing resilience of freight transportation networks
2012,
Zhang Xiaodong
In assessing a network's potential performance given possible future disruptions, one...
Solving a two‐agent single‐machine scheduling problem considering learning effect
2012,
Li Der-Chiang
Scheduling with multiple agents and learning effect has drawn much attention. In this...
First Page
17
18
19
20
21
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers