Computers & Operations Research, Volume 79 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Computers & Operations Research

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 79, March 2017

• 
  • 
  • 
  • 
  • 
    Souvik Ghosh, Abhijit Datta Banik:
    An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue. 1-11
• 
  • 
  • 
  • 
  • 
    Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas:
    New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. 12-18
• 
  • 
  • 
  • 
  • 
    Fábio Cruz, Anand Subramanian, Bruno Petrato Bruck, Manuel Iori:
    A heuristic algorithm for a single vehicle static bike sharing rebalancing problem. 19-33
• 
  • 
  • 
  • 
  • 
    Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo:
    A note on a single-machine lot scheduling problem with indivisible orders. 34-38
• 
  • 
  • 
  • 
  • 
    Mohammad Khoveyni, Robabeh Eslami, Guoliang Yang:
    Negative data in DEA: Recognizing congestion and specifying the least and the most congested decision making units. 39-48
• 
  • 
  • 
  • 
  • 
    Xiao-Kun Chang, Ming Dong:
    Stochastic programming for qualification management of parallel machines in semiconductor manufacturing. 49-59
• 
  • 
  • 
  • 
  • 
    Xianpeng Wang, Lixin Tang:
    A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem. 60-77
• 
  • 
  • 
  • 
  • 
    Zixiang Li, Qiuhua Tang, Liping Zhang:
    Two-sided assembly line balancing problem of type I: Improvements, a simple algorithm and a comprehensive study. 78-93
• 
  • 
  • 
  • 
  • 
    Danial Khorasanian, Ghasem Moslehi:
    Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption. 94-108
• 
  • 
  • 
  • 
  • 
    Alessandro Agnetis, Paolo Detti, Patrick Martineau:
    Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions. 109-118
• 
  • 
  • 
  • 
  • 
    Masoumeh Taslimi, Rajan Batta, Changhyun Kwon:
    A comprehensive modeling framework for hazmat network design, hazmat response team location, and equity of risk. 119-130
• 
  • 
  • 
  • 
  • 
    Sergey Kovalev, Xavier Delorme, Alexandre Dolgui, Ammar Oulamara:
    Minimizing the number of stations and station activation costs for a production line. 131-139
• 
  • 
  • 
  • 
  • 
    Eirik Fernández Cuesta, Henrik Andersson, Kjetil Fagerholt, Gilbert Laporte:
    Vessel routing with pickups and deliveries: An application to the supply of offshore oil platforms. 140-147
• 
  • 
  • 
  • 
  • 
    Matheus Vanzela, Gislaine Mara Melega, Socorro Rangel, Silvio Alexandre de Araujo:
    The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production. 148-160
• 
  • 
  • 
  • 
  • 
    Marcello Braglia, Davide Castellano, Dongping Song:
    Distribution-free approach for stochastic Joint-Replenishment Problem with backorders-lost sales mixtures, and controllable major ordering cost and lead times. 161-173
• 
  • 
  • 
  • 
  • 
    Michel Denault, Jean-Guy Simonato:
    Dynamic portfolio choices by simulation-and-regression: Revisiting the issue of value function vs portfolio weight recursions. 174-189
• 
  • 
  • 
  • 
  • 
    Anand Subramanian, Katyanne Farias:
    Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times. 190-206
• 
  • 
  • 
  • 
  • 
    Qi Zhang, Arul Sundaramoorthy, Ignacio E. Grossmann, José Mauricio Pinto:
    Multiscale production routing in multicommodity supply chains with complex production facilities. 207-222
• 
  • 
  • 
  • 
  • 
    Amir Ahmadi-Javid, Pardis Seyedi, Siddhartha S. Syam:
    A survey of healthcare facility location. 223-263

Special Section on Evolutionary Multiobjective Optimization; Edited by Dimo Brockhoff, Joshua Knowles, Boris Naujoks, and Karthik Sindhya

• 
  • 
  • 
  • 
  • 
    Dimo Brockhoff, Joshua D. Knowles, Boris Naujoks, Karthik Sindhya:
    Editorial. 264-265
• 
  • 
  • 
  • 
  • 
    Juan Esteban Diaz, Julia Handl, Dong-Ling Xu:
    Evolutionary robust optimization in production planning - interactions between number of objectives, sample size and choice of robustness measure. 266-278
• 
  • 
  • 
  • 
  • 
    Dujuan Wang, Feng Liu, Yaochu Jin:
    A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling. 279-290
• 
  • 
  • 
  • 
  • 
    Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh:
    A population-based algorithm for solving linear assignment problems with two objectives. 291-303
• 
  • 
  • 
  • 
  • 
    Murat Köksalan, Diclehan Tezcaner Öztürk:
    An evolutionary approach to generalized biobjective traveling salesperson problem. 304-313
• 
  • 
  • 
  • 
  • 
    Marek Cornu, Tristan Cazenave, Daniel Vanderpooten:
    Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem. 314-330
• 
  • 
  • 
  • 
  • 
    Mohamed Abouhawwash, Haitham Seada, Kalyanmoy Deb:
    Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search. 331-346
• 
  • 
  • 
  • 
  • 
    Renaud Lacour, Kathrin Klamroth, Carlos M. Fonseca:
    A box decomposition algorithm to compute the hypervolume indicator. 347-360

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: