Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures

JM Framinan, P Perez-Gonzalez… - European Journal of …, 2019 - Elsevier
Many activities in industry and services require the scheduling of tasks that can be
concurrently executed, the most clear example being perhaps the assembly of products …

[图书][B] Scheduling

ML Pinedo - 2012 - Springer
Michael L. Pinedo Theory, Algorithms, and Systems Sixth Edition Page 1 Scheduling Michael L.
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …

[图书][B] Planning and scheduling in manufacturing and services

M Pinedo - 2005 - Springer
This book is an outgrowth of an earlier text that appeared in 1999 under the title “Operations
Scheduling with Applications in Manufacturing and Services”, coauthored with Xiuli Chao …

A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times

B de Athayde Prata, CD Rodrigues… - Expert Systems with …, 2022 - Elsevier
Although the customer order scheduling problem to minimize the total completion time has
received a lot of attention from researchers, the literature has not considered so far the case …

Order scheduling models: an overview

JYT Leung, H Li, M Pinedo - … Scheduling: Theory and Applications: 1 st …, 2005 - Springer
Order scheduling models can be described as follows: A machine environment with a
number of non-identical machines in parallel can produce a fixed variety of different …

The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic

JM Framinan, P Perez-Gonzalez - Computers & Operations Research, 2017 - Elsevier
In this paper, we address the 2-stage assembly scheduling problem where there are m
machines in the first stage to manufacture the components of a product and one assembly …

Minimizing the sum of weighted completion times in a concurrent open shop

M Mastrolilli, M Queyranne, AS Schulz… - Operations Research …, 2010 - Elsevier
We study minimizing the sum of weighted completion times in a concurrent open shop. We
give a primal–dual 2-approximation algorithm for this problem. We also show that several …

Scheduling coflows of multi-stage jobs to minimize the total weighted job completion time

B Tian, C Tian, H Dai, B Wang - IEEE INFOCOM 2018-IEEE …, 2018 - ieeexplore.ieee.org
Datacenter networks are critical to Cloud computing. The coflow abstraction is a major leap
forward of application-aware network scheduling. In the context of multistage jobs, there are …

Order scheduling with tardiness objective: Improved approximate solutions

JM Framinan, P Perez-Gonzalez - European Journal of Operational …, 2018 - Elsevier
The problem addressed in this paper belongs to the topic of order scheduling, in which
customer orders–composed of different individual jobs–are scheduled so the objective …

New approximate algorithms for the customer order scheduling problem with total completion time objective

JM Framinan, P Perez-Gonzalez - Computers & Operations Research, 2017 - Elsevier
In this paper, we study a customer order scheduling problem where a number of orders,
composed of several product types, have to be scheduled on a set of parallel machines …