Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs

Y Yin, TCE Cheng, DJ Wang, CC Wu - Journal of scheduling, 2017 - Springer
We consider the scheduling problem in which two agents (agents A and B), each having its
own job set (containing the A-jobs and B-jobs, respectively), compete to process their own …

[图书][B] Due Date-Related Scheduling with Two Agents

Y Yin, D Wang, TCE Cheng - 2020 - Springer
This book provides an introduction to the models, methods, and results of some due date-
related scheduling problems in the context of multi-agent scheduling. In multi-agent …

Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system

D Shabtay - Naval Research Logistics (NRL), 2023 - Wiley Online Library
We study a set of scheduling problems in a distributed flow‐shop scheduling system
consisting of several flow‐shop production systems (factories) working in parallel. Our …

[HTML][HTML] Two-agent single-machine scheduling problem with just-in-time jobs

BC Choi, J Chung - Theoretical Computer Science, 2014 - Elsevier
We consider two scheduling problems on a single machine with two agents. The objective is
to optimize the performance measure for agent 1 while maintaining the weighted number of …

A Study of Flight Scheduling Problem on Fighter Squadron

M Lee, S Seo - Journal of the Korean Operations Research and …, 2014 - koreascience.kr
Fighter squadron flight scheduling is the integrated air operation plan that is an important
role for improving pilot's flight skill and maintaining combat readiness by efficient using …

Interval Balanced Multiprocessor Scheduling of Modular Jobs

MS Levin - Journal of Communications Technology and …, 2021 - Springer
This article addresses multiprocessor scheduling of modular jobs while taking into account a
balance requirements for each time interval. First, a brief description of just-in-time (JIT) …

A just-in-time scheduling problem with two competing agents

BC Choi, J Chung, MJ Park - Optimization Letters, 2020 - Springer
We consider a single-machine scheduling problem with two competing agents. The
objective is to minimize the total weighted completion time of jobs of agent 1 with a …

Employment contract-based management model of production resources on relation-driven fractal organization

M Shin - Journal of Korean Institute of Industrial Engineers, 2013 - koreascience.kr
Up-to-date market dynamics and intense competition have forced a production system to be
more widely distributed and decentralized than ever, and the production system itself can be …

Two-Agent Scheduling with Preemptions and Just-in-Time Jobs

BC Choi, MJ Park, J Chung - 한국경영과학회지, 2019 - dbpia.co.kr
We consider a two-agent single-machine scheduling problem under the environment that
preemptions are allowed for the jobs of agent 1. The objective is to minimize the weighted …

Многопроцессорные расписания модульных работ с балансом по интервалам

МШ Левин - Информационные процессы, 2018 - elibrary.ru
В статье рассматривается задача составления многопроцессорного расписания
составных (модульных) работ с балансом по временным интервалам. Приведен обзор …