Scheduling With Discretely Compressible Release Dates to Minimize Makespan

Asia-Pacific Journal of Operational Research - Singapore
doi 10.1142/s0217595910002818
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

Single-Machine Scheduling With Deteriorating Jobs and Learning Effects to Minimize the Makespan

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2007English

An Exact Approach to Early/Tardy Scheduling With Release Dates

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2005English

Single Machine Batch Processing Problem With Release Dates to Minimize Total Completion Time

International Journal of Industrial Engineering Computations
IndustrialManufacturing Engineering
2018English

Matchup Scheduling With Multiple Resources, Release Dates and Disruptions

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1991English

A Particle Swarm Optimization to Minimize Makespan for a Four-Stage Multiprocessor Open Shop With Dynamic Job Release Time

World Journal of Engineering and Technology
2015English

Optimal On-Line Algorithms to Minimize Makespan on Two Machines With Resource Augmentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Minimum Makespan Scheduling With Low Rank Processing Times

2013English

Parallel Machine Scheduling to Minimize Energy Consumption

2020English

Applying an Overlapped Design Schedule Based Dependency Structure Matrix to Minimize Project Makespan

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy