Filters








8,824 Hits in 3.9 sec

A GRASP for Parallel Machine Scheduling with Time Windows

Siwate Rojanasoonthon, Jonathan Bard
2005 INFORMS journal on computing  
T his paper presents a greedy randomized adaptive search procedure (GRASP) for scheduling n jobs on m nonhomogeneous parallel machines with time windows.  ...  The objective is to maximize the number of jobs scheduled, where a job in a higher priority class has infinitely more value than a job in a lower priority class. The GRASP consists of two phases.  ...  Acknowledgments This work was supported in part by a grant from the Texas Higher Education Coordinating Board under the Advanced Research Program.  ... 
doi:10.1287/ijoc.1030.0048 fatcat:uvb2wptwmrhkzptos4iexx524m

Page 819 of The Journal of the Operational Research Society Vol. 54, Issue 8 [page]

2003 The Journal of the Operational Research Society  
A grasp for parallel machine scheduling with time windows. Working Paper, 2001, Graduate Program in Operations Research. University of Texas, Austin, TX. Or I.  ...  Nevertheless, the time required to find good solutions with the GRASP is highly dependent on the value S Rojanasoonthon et a/—Algorithms for parallel machine scheduling 819 specified for the input parameter—number  ... 

Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system

S Rojanasoonthon, J F Bard, S D Reddy
2003 Journal of the Operational Research Society  
A grasp for parallel machine scheduling with time windows. Working Paper, 2001, Graduate Program in Operations Research. University of Texas, Austin, TX. Or I.  ...  '° The parallel machine scheduling problem with time windows can be thought of as a multiple tour, maximum collection problem with time windows.  ... 
doi:10.1057/palgrave.jors.2601575 fatcat:4c66adgqbvf2lj3kbayitou33e

A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities

Jonathan F. Bard, Siwate Rojanasoonthon
2005 Naval Research Logistics  
This paper presents a branch-and-price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows.  ...  The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has "infinitely" more weight or value than a job in a lower priority class.  ...  Scheduling Jobs with Time Windows and Job Priorities on Parallel Machines Gabrel [12] focused on the problem of scheduling n nonpreemptive jobs, each with a given processing time and an interval for  ... 
doi:10.1002/nav.20118 fatcat:hqbgvaswnjdxpbmct6lohhb2ym

Page 564 of The Journal of the Operational Research Society Vol. 60, Issue 4 [page]

2009 The Journal of the Operational Research Society  
Optimal single-machine scheduling with earliness and tardiness penalties. Opns Res 26: 1079-1082. Li Y, Lim A and Rodrigues B (2004). Crossdocking—JIT scheduling with time windows.  ...  A search heuristic for just-in-time scheduling in parallel machines. J /ntell Manuf 2: 253-260. Lakshminarayan S, Lakshmanan R, Papineau RL and Rochette R (1978).  ... 

A New Neuro-Dominance Rule for Single Machine Tardiness Problem with Unequal Release Dates [chapter]

Tarık Çakar
2006 Lecture Notes in Computer Science  
A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing, 7:10-23, 1995.[20] P.M. Pardalos, L. Pitsoulis, T. Mavridou, and M.G.C.Resende.  ...  A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties. Computers & Operations Research, 23:881-895, 1996. [27] J.B. Ghosh.  ... 
doi:10.1007/11840930_100 fatcat:qreid5yz7nhi5pstxv5d43puoa

Page 174 of The Journal of the Operational Research Society Vol. 48, Issue 2 [page]

1997 The Journal of the Operational Research Society  
A GRASP for a difficult single scheduling problem Comps and Opns Res 18 (8): 635-643. Kontoravdis G and Bard JF (1995). A GRASP for the vehicle routing problem with time windows ORSA J.  ...  A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints Comps and Opns Res 21 (9): 1025-1033. Crainic TG, Toulouse M and Gendreau M (1995).  ... 

An annotated bibliography of GRASP-Part II: Applications

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  In this paper, we cover the literature where GRASP is applied to scheduling,  ...  The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with nonrelated parallel machines and sequence-dependent setup times.  ... 
doi:10.1111/j.1475-3995.2009.00664.x fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm

UMA ABORDAGEM SIMHEURÍSTICA PARA UM PROBLEMA ESTOCÁSTICO DE PROGRAMAÇÃO DE NAVIOS

VICTOR ABU-MARRUL CARNEIRO DA CUNHA
2021 SEMINÁRIOS DE ACOMPANHAMENTO À PESQUISA EM ENGENHARIA DE PRODUÇÃO  
Multi-Relocate GRASP-Math Matheuristics for a Parallel Machine Scheduling Problem with Non-Anticipatory Family Setup Times: Application in the Offshore Oil and Gas Industry.  ...  ILS e IGS com RVND Iterated Greedy Algorithms for a Complex Parallel Machine Scheduling Problem.  ... 
doi:10.17771/pucrio.seminarppgep.52896 fatcat:wizdgahrqjdrdlluhy355jzu3y

Grasp: An Annotated Bibliography [chapter]

Paola Festa, Mauricio G.C. Resende
2002 Operations Research/Computer Science Interfaces Series  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing.  ...  McGahan.A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties.Computers & Operations Research, 23:881-895, 1996.A GRASP for single machine scheduling with  ... 
doi:10.1007/978-1-4615-1507-4_15 fatcat:kvaokik4m5a2bezgzzcfaqjbui

A GRASP-based Approach for Demand Responsive Transportation

Rui Gomes, Jorge Pinho de Sousa, Teresa Galvão Dias
2014 International Journal of Transportation  
demand, possibly in real-time.  ...  Experiments with simple cases, inspired in real problems, have shown the potential of this approach for efficiently designing and managing DRT services.  ...  For example, in [19] each costumer as a demand of units, a delivery time window and a service time.  ... 
doi:10.14257/ijt.2014.2.1.02 fatcat:sgnmguzm25g3hjlax2k6rzmjyi

Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties

João Paulo de C. M. Nogueira, José Elias C. Arroyo, Harlem Mauricio M. Villadiego, Luciana B. Gonçalves
2014 Electronical Notes in Theoretical Computer Science  
This paper considers an unrelated parallel machine scheduling problem with the objective of minimizing the total earliness and tardiness penalties.  ...  Machine and job-sequence dependent setup times and idle times are considered.  ...  Among different production scheduling problems, parallel machine scheduling (PMS) is a typical scheduling problem with extensive practical relevance.  ... 
doi:10.1016/j.entcs.2014.01.020 fatcat:rp7sgexnjvbsniydvzlpdrr5eq

An annotated bibliography of GRASP - Part I: Algorithms

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing.  ...  The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with non-related parallel machines and sequence-dependent setup times.  ... 
doi:10.1111/j.1475-3995.2009.00663.x fatcat:gqolwm2hafgzlfdckt7kblixgu

Crossdocking— Just in Time scheduling: an alternative solution approach

G A Álvarez-Pérez, J L González-Velarde, J W Fowler
2009 Journal of the Operational Research Society  
Optimal single-machine scheduling with earliness and tardiness penalties. Opns Res 26: 1079-1082. Li Y, Lim A and Rodrigues B (2004). Crossdocking—JIT scheduling with time windows.  ...  There is litthke research on JIT scheduling for parallel machines and most research done on this problem deals with a common due date (d).  ... 
doi:10.1057/palgrave.jors.2602590 fatcat:xk5o36ukwvfb5pnq7ujsvzjzjm

Strategies for the Parallel Implementation of Metaheuristics [chapter]

Van-Dat Cung, Simone L. Martins, Celso C. Ribeiro, Catherine Roucairol
2002 Operations Research/Computer Science Interfaces Series  
The MIMD family (Multiple Instruction Stream, Multiple Data Stream machines, according with Flynn's taxonomy [84]) evolved from shared-memory machines with a few processors (Sequent Balance, Encore Multimax  ...  ) to distributedmemory machines with hundreds or even thousands of processors interconnected by networks with different topologies, such as the hierarchical ring for the KSR, the two-dimensional grid for  ...  [20] implemented a parallel algorithm for vehicle routing with time windows, combining single-and multiple-walk strategies.  ... 
doi:10.1007/978-1-4615-1507-4_13 fatcat:syvr7spvynhntdp6ya44ntlimq
« Previous Showing results 1 — 15 out of 8,824 results