Results 41 to 50 of about 14,397 (225)

Makespan preserving flowshop reengineering via blocking constraints

open access: yes, 2019
Blocking constraints are ubiquitous in machine scheduling. In a flowshop scenario, a machine might get blocked by a job that has just been processed by the same machine.
Newton, MA Hakim   +2 more
core   +1 more source

Task Scheduling in Cloud Environment–Techniques, Applications, and Tools: A Systematic Literature Review

open access: yesIEEE Access
Cloud computing has become a revolutionary model for providing computational resources and services via the internet. As the volume of tasks and the dynamic nature of cloud resources increase, several critical challenges emerge, including load balancing,
Olanrewaju L. Abraham   +3 more
doaj   +1 more source

Optimization of structural assembly scheduling in the aeronautics industry

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In the aeronautical industry, structural assembly refers to the stage in which parts, subassemblies, and main aircraft structures are fitted together, forming aerostructures. Aircraft structural assembly requires many complex activities to be performed over an intricate precedence network and is subject to interactions among the various ...
Bruno Jensen Virginio da Silva   +3 more
wiley   +1 more source

Makespan Time.

open access: yes, 2016
Makespan Time.
Gaddafi Abdul-Salaam (3158541)   +3 more
core   +1 more source

A Mixed-Integer Linear Programming Model for Addressing Efficient Flexible Flow Shop Scheduling Problem with Automatic Guided Vehicles Consideration

open access: yesApplied Sciences
With the development of Industry 4.0, discrete manufacturing systems are accelerating their transformation toward flexibility and intelligence to meet the market demand for various products and small-batch production.
Dekun Wang   +6 more
doaj   +1 more source

A Load Balancing Algorithm for the Data Centres to Optimize Cloud Computing Applications

open access: yesIEEE Access, 2021
Despite the many past research conducted in the Cloud Computing field, some challenges still exist related to workload balancing in cloud-based applications and specifically in the Infrastructure as service (IaaS) cloud model.
Dalia Abdulkareem Shafiq   +3 more
doaj   +1 more source

Assessing second‐price auctions for parcel exchanges in last‐mile logistics

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The rapid growth of e‐commerce has led to multiple carriers operating in the same regions, creating opportunities for collaboration. However, logistics companies typically operate independently, leading to inefficiencies. Horizontal cooperation, where carriers share resources and infrastructure, can improve efficiency and reduce costs.
Christian Truden, Margaretha Gansterer
wiley   +1 more source

A genetic algorithm for scheduling an automated machine cell with tool and pallet–fixture setups

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract This paper solves the scheduling problem of identical parallel machines with tooling and pallet–fixture constraints in a high‐mix, low‐volume, high‐complexity manufacturing environment. The machines are connected through an automated material handling device and in‐between buffer places that allow for autonomous production.
Koen Herps   +3 more
wiley   +1 more source

Efficient exact formulations for the flexible job shop scheduling with flexible maintenance

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In modern manufacturing systems, integrating preventive maintenance into production scheduling is essential to ensure operational efficiency and equipment reliability. This paper addresses the flexible job shop scheduling problem under machine unavailability constraints caused by non‐fixed maintenance tasks.
Tom Perroux   +4 more
wiley   +1 more source

Power-aware scheduling for makespan and flow [PDF]

open access: yesProceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006
We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem when every job requires the same ...
openaire   +6 more sources

Home - About - Disclaimer - Privacy