FORMULAÇÃO BUCKET-INDEXED: UMA NOVA ABORDAGEM PARA RESOLVER O PROBLEMA DE PROGRAMAÇÃO DE MÁQUINAS PARALELAS | Zendy

AI Assistant Blog Pricing

Open Access

FORMULAÇÃO BUCKET-INDEXED: UMA NOVA ABORDAGEM PARA RESOLVER O PROBLEMA DE PROGRAMAÇÃO DE MÁQUINAS PARALELAS

Author(s) -

Luana Mesquita Carrilho

Publication year - 2019

Language(s) - Portuguese

Resource type - Dissertations/theses

DOI - 10.17771/pucrio.acad.46469

Subject(s) - scheduling (production processes) , integer programming , job shop scheduling , mathematical optimization , single machine scheduling , time horizon , linear programming , computer science , mathematics , schedule , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.