Results 61 to 70 of about 9,841 (196)

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

A Comparative Analysis Of Tardiness Policies Of Elementary Schools [PDF]

open access: yes, 2020
Previous research has shown that student tardiness has been a challenge for educators as far back as the institution of modern schooling. While there has been considerable research about student absenteeism, student tardiness remains an under researched ...
Goodwin, Diana J.
core   +1 more source

A branch-and-bound algorithm to minimize total tardiness in a two-machine flowshop problem with different release time

open access: yesJournal of Advanced Mechanical Design, Systems, and Manufacturing, 2019
In this study, we consider the scheduling problem for two-machine flowshops with jobs of the different release times. In many real situations, jobs can be arrived at different times due to progress of jobs in the preceding stage or the status of supply ...
June-Young BANG, BongJoo JEONG
doaj   +1 more source

The one‐dimensional cutting stock problem with sequence‐dependent setups

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects.
Eduardo M. Silva   +3 more
wiley   +1 more source

Impacts of Edge AI/agentic AI on supply chain management and operations research

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Edge AI refers to the deployment and execution of artificial intelligence (AI) algorithms on decentralized, local computing devices (e.g., Internet of Things) rather than relying on centralized cloud‐based computing infrastructures. The literature has addressed the increasing importance of AI in supply chain and operations management (SCOM ...
Dmitry Ivanov
wiley   +1 more source

Permutation Flowshop Scheduling with Earliness and Tardiness Penalties [PDF]

open access: yes
We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process.
Peeyush Mehta   +2 more
core  

Exploring the Impact of Ergonomics on Employees’ Nonattendance Behaviors: The Mediating Role of Work Engagement

open access: yesSAGE Open
Our study aims to offer a research model that investigates the role of work engagement as a mediator in the relationship between ergonomics and absenteeism, and tardiness behaviors among employees.
Dalia Khalid Faeq, Pakzad Fadel Saleh
doaj   +1 more source

What Is the Structure of Political Contestation on Digital Policy in Europe? Evidence From the DSA/DMA Package

open access: yesJCMS: Journal of Common Market Studies, EarlyView.
Abstract In recent years, the European Union (EU) expanded its digital regulatory competences. However, it is not clear which political trade‐offs occur in decision‐making on digital policy issues. This study examines how European parliamentarians and their party groups position themselves on these issues and which conflict lines emerge. Analysing roll
Adam Geoffrey Tyler, Ben Crum
wiley   +1 more source

Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs [PDF]

open access: yes
In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique.
Jorge M. S. Valente
core  

Generalized tardiness bounds for global multiprocessor scheduling

open access: yes, 2007
We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety of such algorithms (including some whose tardiness behavior has not been ...
James Anderson   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy