Truncation and Composition of Schedules: A Good Strategy for Solving Bicriteria Scheduling Problems

American Journal of Scientific and Industrial Research
doi 10.5251/ajsir.2010.1.3.427.434
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Science Hub

Related search

A Genetic Algorithm for Solving Bicriteria Network Topology Design Problems

Journal of Japan Society for Fuzzy Theory and Systems
2000English

A Submodular Optimization Approach to Bicriteria Scheduling Problems With Controllable Processing Times on Parallel Machines

SIAM Journal on Discrete Mathematics
Mathematics
2013English

A Genetic Algorithm for a Bicriteria Flow-Shop Scheduling Problem

Transactions of the Institute of Systems, Control and Information Engineers
1997English

Adaptive Problem-Solving for Large-Scale Scheduling Problems: A Case Study

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Using Degrees of Freedom as a Pervasive Strategy for Improving Problems Solving

English

An Adaptive Pursuit Genetic Algorithm for Solving Job-Shop Scheduling Problems

2018English

Collective Behavior Bees for Solving HW/SW Partitioning and Scheduling Problems in RSoC

Transactions on Machine Learning and Artificial Intelligence
2017English

Solving Practical Railway Crew Scheduling Problems With Attendance Rates

Wirtschaftsinformatik
Information Systems
2017English

How Good a Shallow Neural Network Is for Solving Non-Linear Decision Making Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy