Sciweavers

    388 search results - page 3 / 78
    » A Mixed Closure-CSP Method to Solve Scheduling Problems
    Sort
    View
    COR
    2007
    176views more  COR 2007»
    Scheduling and routing of automated guided vehicles: A hybrid approach
    13 years 8 months ago
    Scheduling and routing of automated guided vehicles: A hybrid approach
    Download  www.crt.umontreal.ca
    We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
    Ayoub Insa Corréa, André Langevin, L...
    claim paper
    Read More »
    KCAP
    2003
    ACM
    116views Information Technology» more  KCAP 2003»
    A generic library of problem solving methods for scheduling applications
    14 years 1 months ago
    A generic library of problem solving methods for scheduling applications
    Download  eprints.aktors.org
    In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
    Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdr&aa...
    claim paper
    Read More »
    ATMOS
    2007
    183views Optimization» more  ATMOS 2007»
    Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
    13 years 10 months ago
    Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
    Download  drops.dagstuhl.de
    This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
    Erwin J. W. Abbink, Joel Van't Wout, Dennis Huisma...
    claim paper
    Read More »
    COR
    2010
    121views more  COR 2010»
    Parallel machine scheduling with precedence constraints and setup times
    13 years 8 months ago
    Parallel machine scheduling with precedence constraints and setup times
    Download  hal.archives-ouvertes.fr
    This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
    Bernat Gacias, Christian Artigues, Pierre Lopez
    claim paper
    Read More »
    MP
    2002
    165views more  MP 2002»
    A feasible semismooth asymptotically Newton method for mixed complementarity problems
    13 years 8 months ago
    A feasible semismooth asymptotically Newton method for mixed complementarity problems
    Download  www.math.nus.edu.sg
    Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
    Defeng Sun, Robert S. Womersley, Houduo Qi
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.