187 research outputs found

    An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint

    Get PDF
    In this paper we study the classical scheduling problem of minimizing the total weighted completion time on a single machine with the constraint that one specific job must be scheduled at a specified position. We give dynamic programs with pseudo-polynomial running time, and a fully polynomial-time approximation scheme (FPTAS)

    Parallel-machine scheduling with simple linear deterioration to minimize total completion time

    Get PDF
    2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

    Order Acceptance and Scheduling: A Taxonomy and Review

    Get PDF
    Over the past 20 years, the topic of order acceptance has attracted considerable attention from those who study scheduling and those who practice it. In a firm that strives to align its functions so that profit is maximized, the coordination of capacity with demand may require that business sometimes be turned away. In particular, there is a trade-off between the revenue brought in by a particular order, and all of its associated costs of processing. The present study focuses on the body of research that approaches this trade-off by considering two decisions: which orders to accept for processing, and how to schedule them. This paper presents a taxonomy and a review of this literature, catalogs its contributions and suggests opportunities for future research in this area

    Scheduling linear deteriorating jobs with an availability constraint on a single machine

    Get PDF
    2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

    Parameterized complexity of machine scheduling: 15 open problems

    Full text link
    Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory.Comment: Version accepted to Computers & Operations Researc

    FPTAS for half-products minimization with scheduling applications

    Get PDF
    Cataloged from PDF version of article.A special class of quadratic pseudo-boolean functions called “half-products” (HP) has recently been introduced. It has been shown that HP minimization, while NP-hard, admits a fully polynomial time approximation scheme (FPTAS). In this note, we provide a more efficient FPTAS. We further show how an FPTAS can also be derived for the general case where the HP function is augmented by a problem-dependent constant and can justifiably be assumed to be nonnegative. This leads to an FPTAS for certain partitioning type problems, including many from the field of scheduling. c 2008 Elsevier B.V. All rights reserved

    An FPTAS for scheduling with piecewise linear decreasing processing times to minimize makespan

    Get PDF
    Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
    corecore