Author: Suresh Chand
Publisher:
ISBN:
Category :
Languages : en
Pages : 34
Book Description
Two-stage Approximation Heuristic for the Single Machine Scheduling Problem where the Objective is to Minimize Weighted Earliness
TWO-STAGE APPROXIMATION HEURISTIC FOR THE SINGLE MACHINE SCHEDULING PROBLEM WHERE THE OBJECTIVE IS TO MINIMIZE WEIGHTED EARLINESS
Author: SURESH CHAND AND HANS SCHNEEBERGER
Publisher:
ISBN:
Category :
Languages : en
Pages : 21
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 21
Book Description
Single Machine Scheduling to Minimize Weighted Earliness Subject to No Tardy Job
ALGORITHMS FOR SINGLE MACHINE SCHEDULING PROBLEMS MINIMIZING TARDINESS AND EARLINESS
Author: Candace A. Yano, Yeong-Dae Kim
Publisher:
ISBN:
Category :
Languages : en
Pages : 26
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 26
Book Description
Precedence Constrained Scheduling to Minimize Weighted Completion Time on a Single Machine
Author: Stanford University. Computer Science Department
Publisher:
ISBN:
Category :
Languages : en
Pages : 6
Book Description
We consider the problem of scheduling a set of jobs on a single machine with the objective of mimizing weighted (average) completion time. The problem is NP-hard when there are precedence constraints between jobs, [12] and we provide a simple and efficient combinatorial 2-approximation algorithm. In contrast to our work, earlier approximation altorithms [9] achieving the same ratio are based on solving a linear programming relaxation of the problem.
Publisher:
ISBN:
Category :
Languages : en
Pages : 6
Book Description
We consider the problem of scheduling a set of jobs on a single machine with the objective of mimizing weighted (average) completion time. The problem is NP-hard when there are precedence constraints between jobs, [12] and we provide a simple and efficient combinatorial 2-approximation algorithm. In contrast to our work, earlier approximation altorithms [9] achieving the same ratio are based on solving a linear programming relaxation of the problem.
INFORMS Conference Program
Author: Institute for Operations Research and the Management Sciences. National Meeting
Publisher:
ISBN:
Category : Industrial management
Languages : en
Pages : 180
Book Description
Publisher:
ISBN:
Category : Industrial management
Languages : en
Pages : 180
Book Description
Algorithms for Scheduling Problems
Author: FrankWerner
Publisher: MDPI
ISBN: 3038971197
Category : Mathematics
Languages : en
Pages : 209
Book Description
This book is a printed edition of the Special Issue " Algorithms for Scheduling Problems" that was published in Algorithms
Publisher: MDPI
ISBN: 3038971197
Category : Mathematics
Languages : en
Pages : 209
Book Description
This book is a printed edition of the Special Issue " Algorithms for Scheduling Problems" that was published in Algorithms
Single Machine Scheduling with Precedence Constraints
Author: José Correa
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming community since Sidney's pioneering work in 1975. We look at the problem from a polyhedral perspective and uncover a relation between Sidney's decomposition theorem and different linear programming relaxations. More specifically, we present a generalization of Sidney's result, which particularly allows us to reason that virtually all known 2-approximation algorithms comply with his decomposition. Moreover, we establish a connection between the single-machine scheduling problem and the vertex cover problem. Indeed, in the special case of series-parallel precedence constraints, we prove that the sequencing problem can be seen as a special case of the vertex cover problem. We also argue that this result is true for general precedence constraints if one can show that a certain integer program represents a valid formulation of the sequencing problem. Finally, we give a 3/2-approximation algorithm for two-dimensional partial orders, and we also provide a characterization of the active inequalities of a linear programming relaxation in completion time variables.
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Book Description
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming community since Sidney's pioneering work in 1975. We look at the problem from a polyhedral perspective and uncover a relation between Sidney's decomposition theorem and different linear programming relaxations. More specifically, we present a generalization of Sidney's result, which particularly allows us to reason that virtually all known 2-approximation algorithms comply with his decomposition. Moreover, we establish a connection between the single-machine scheduling problem and the vertex cover problem. Indeed, in the special case of series-parallel precedence constraints, we prove that the sequencing problem can be seen as a special case of the vertex cover problem. We also argue that this result is true for general precedence constraints if one can show that a certain integer program represents a valid formulation of the sequencing problem. Finally, we give a 3/2-approximation algorithm for two-dimensional partial orders, and we also provide a characterization of the active inequalities of a linear programming relaxation in completion time variables.
Industrial Engineering in the Internet-of-Things World
Author: Fethi Calisir
Publisher: Springer Nature
ISBN: 3030767248
Category : Technology & Engineering
Languages : en
Pages : 486
Book Description
This book gathers extended versions of the best papers presented at the Global Joint Conference on Industrial Engineering and Its Application Areas (GJCIE), organized virtually on August 14–15, 2020, by Istanbul Technical University. It covers a wide range of topics, including decision analysis, supply chain management, systems modelling and quality control. Further, special emphasis is placed on cutting-edge applications of industrial Internet-of-Things. Technological, economic and business challenges are discussed in detail, presenting effective strategies that can be used to modernize current structures, eliminating the barriers that are keeping industries from taking full advantage of IoT technologies. The book offers an important link between technological research and industry best practices, and covers various disciplinary areas such as manufacturing, healthcare and service engineering, among others.
Publisher: Springer Nature
ISBN: 3030767248
Category : Technology & Engineering
Languages : en
Pages : 486
Book Description
This book gathers extended versions of the best papers presented at the Global Joint Conference on Industrial Engineering and Its Application Areas (GJCIE), organized virtually on August 14–15, 2020, by Istanbul Technical University. It covers a wide range of topics, including decision analysis, supply chain management, systems modelling and quality control. Further, special emphasis is placed on cutting-edge applications of industrial Internet-of-Things. Technological, economic and business challenges are discussed in detail, presenting effective strategies that can be used to modernize current structures, eliminating the barriers that are keeping industries from taking full advantage of IoT technologies. The book offers an important link between technological research and industry best practices, and covers various disciplinary areas such as manufacturing, healthcare and service engineering, among others.
Dissertation Abstracts International
Author:
Publisher:
ISBN:
Category : Dissertations, Academic
Languages : en
Pages : 852
Book Description
Publisher:
ISBN:
Category : Dissertations, Academic
Languages : en
Pages : 852
Book Description