Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem

DOI10.1007/s10951-014-0376-yzbMath1305.90195OpenAlexW2049093006MaRDI QIDQ490324

Michael Masin, Tal Raviv

Publication date: 22 January 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0376-y

zbMATH Keywords

optimizationheuristicsapproximationsjobshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

A branch and cut heuristic for a runway scheduling problem ⋮ An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan ⋮ Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• A simplex based algorithm to solve separated continuous linear programs
• High-multiplicity cyclic job shop scheduling
• On some geometric methods in scheduling theory: A survey
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• The complexity of cyclic shop scheduling problems
• NP-hardness of shop-scheduling problems with three jobs
• A framework for the complexity of high-multiplicity scheduling problems
• Single Machine Scheduling with Release Dates
• LP-Based Online Scheduling: From Single to Parallel Machines
• A Fluid Heuristic for Minimizing Makespan in Job Shops
• From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Computational Complexity of Discrete Optimization Problems
• Improved Approximation Algorithms for Shop Scheduling Problems
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Short Shop Schedules
• Performance Measures and Schedules in Periodic Job Shops
• Stability and Instability of Fluid Models for Reentrant Lines
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
• List Scheduling in Order of α-Points on a Single Machine
• Scheduling jobshops with some identical or similar jobs

This page was built for publication: Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem