Open Advanced Search

Log in
Enterprise Plans
Sign Up

Log in
Sign Up
Enterprise Plans
Browse
Features
Pricing

DeepDyve

Advanced Search

show/hide query preview

With all of the words or DOIs:

DeepDyve's default query mode: search by keyword or DOI.

With the exact phrase:

Require these words, in this exact order. Do not surround your terms in double-quotes ("") in this field.

With at least one of the words:

Find any of these words, separated by spaces

Without the words:

Exclude each of these words, separated by spaces

With words in the article title:

Search for these terms only in the title of an article

Published between the years:

With the following authors:

Most effective as: LastName, First Name or Lastname, FN

With words in the journal name:

Search for articles published in journals where these words are in the journal name

Reset filters

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

Combinatorial Optimization Problems in Planning and Decision Making

Part of the Studies in Systems, Decision and Control Book Series (volume 173)

DOI: 10.1007/978-3-319-98977-8

ISBN: 978-3-319-98976-1

Publisher: Springer International Publishing - Springer Journals

Sep 25, 2018

1 - 9 of 9 Chapters

LitStream

Chapter 1Introduction

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 1 –14

[We formulate the research problems which are a generalization of our earlier results in the field of intractable combinatorial optimization problems. On the basis of these problems, we have created a hierarchical model of planning and decision making for objects with a network representation of...
LitStream

Optimal Scheduling for Two Criteria for a Single Machine with Arbitrary Due Dates of Tasks

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 17 –38

[We consider the problem of constructing a feasible (in which all tasks complete before their due dates) schedule for a single machine with arbitrary due dates and maximum start time of the machine or minimum total earliness of the tasks completion times in relation to their due dates. It is...
LitStream

Optimal Scheduling for Vector or Scalar Criterion on Parallel Machines with Arbitrary Due Dates of Tasks

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 39 –105

[We examine the problem of constructing a feasible schedule for parallel machines of equal or various productivities with various due dates of tasks and arbitrary start times of machines. We consider two optimality criteria: maximizing the earliest start time of machines (scalar criterion) or...
LitStream

The Total Weighted Tardiness of Tasks Minimization on a Single Machine

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 107 –217

[We solve the problem of constructing a schedule for a single machine with various due dates and a fixed start time of the machine that minimizes the sum of weighted tardiness of tasks in relation to their due dates. The problem is NP-hard in the strong sense and is one of the most known...
LitStream

The Total Earliness/Tardiness Minimization on a Single Machine with Arbitrary Due Dates

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 219 –263

[We solve a single machine problem of constructing a schedule of tasks with arbitrary due dates on a single machine that minimizes the total earliness/tardiness in relation to their due dates. This problem is solved in three different formulations: (1) the start time of the machine is fixed. In...
LitStream

The Total Tardiness of Tasks Minimization on Identical Parallel Machines with Arbitrary Fixed Times of Their Start and a Common Due Date

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 265 –290

[We solve a NP-hard problem of constructing a schedule for identical parallel machines that minimizes the total tardiness of tasks in relation to a common due date in case when the start times of machines are fixed at arbitrary time points less than the due date. We present an efficient...
LitStream

The Total Weighted Completion Time of Tasks Minimization with Precedence Relations on a Single Machine

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 291 –344

[We consider the problem of constructing a schedule for a single machine that minimizes the total weighted completion time of tasks when the restrictions on their processing order are given by an arbitrary oriented acyclic graph. The problem is NP-hard in the strong sense. Efficient polynomial...
LitStream

The Four-Level Model of Planning and Decision Making

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 347 –406

[We provide an overview of known models, methods and software for scheduling and operational planning for objects with a network representation of technological processes and limited resources. The problem is an operational plan construction to produce a potential order portfolio which is the...
LitStream

Algorithms and Software of the Four-Level Model of Planning and Decision Making

Zgurovsky, Michael Z.; Pavlov, Alexander A.

Pages: 407 –518

[We give an interrelated description for all algorithms which implement a procedure of scheduling and operative planning on the basis of formal procedures and expert solutions. We have achieved this result sequentially solving the following problems: (1) we formalize the network representation of...

results per page

Browse All eBooks

Features

Search and discover articles on DeepDyve, PubMed, and Google Scholar
Read the full-text of open access and premium content
Organize articles with folders and bookmarks
Collaborate on and share articles and folders

Info

Pricing
Enterprise Plans
Browse Journals & Topics
About DeepDyve

Help

Help
Publishers
Contact Us

Sign up for your DeepDyve account now!

Read and print from thousands of top scholarly journals.

System error. Please try again!

Continue with Facebook

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Save Article to Bookmarks

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.

Subscribe to Journal Email Alerts

To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Follow a Journal

To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Our policy towards the use of cookies

All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.

cookie policy