Open shops with jobs overlap

DOI10.1016/0377-2217(93)90347-PzbMath0797.90047OpenAlexW2092204527MaRDI QIDQ1319530

Chelliah Skriskandarajah, Edouard Wagneur

Publication date: 25 October 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90347-p

zbMATH Keywords

open shopheuristicparallel processingmaximum completion timepolynomial time algorithmstotal tardinessmaximum tardinesssum of completion timespermutation schedulesoverlapping of jobs

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (23)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ On the complexity of preemptive openshop scheduling problems ⋮ Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Customer order scheduling to minimize the number of late jobs ⋮ New approximate algorithms for the customer order scheduling problem with total completion time objective ⋮ The representation of partially-concurrent open shop problems ⋮ Order scheduling in an environment with dedicated resources in parallel ⋮ A note on the complexity of the concurrent open shop problem ⋮ Scheduling orders for multiple product types to minimize total weighted completion time ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Minimizing the sum of weighted completion times in a concurrent open shop ⋮ Partially concurrent open shop scheduling with integral preemptions ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ Preemptive multiprocessor order scheduling to minimize total weighted flowtime ⋮ Open shops with jobs overlap -- revisited ⋮ Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms ⋮ Order Scheduling Models: Hardness and Algorithms ⋮ Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps ⋮ Scheduling orders for multiple product types with due date related objectives

Cites Work

• Global analysis and economics. III: Pareto Optima and price equilibria
• On the complexity of preemptive openshop scheduling problems
• A Note On The Complexity Of Openshop Scheduling Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Open shops with jobs overlap