Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
type: Item
instance of: scholarly article
title: Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
zbMATH Open document ID: 1305.90195
author: Michael Masin
author: Tal Raviv
published in: Journal of Scheduling
publication date: 2015-01-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6389259
zbMATH Keywords: optimization
zbMATH Keywords: jobshop
zbMATH Keywords: approximations
zbMATH Keywords: heuristics
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: s10951-014-0376-y
OpenAlex ID: W2049093006
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
cites work: From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
cites work: From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
cites work: Scheduling jobshops with some identical or similar jobs
cites work: A framework for the complexity of high-multiplicity scheduling problems
cites work: LP-Based Online Scheduling: From Single to Parallel Machines
cites work: Stability and Instability of Fluid Models for Reentrant Lines
cites work: A Fluid Heuristic for Minimizing Makespan in Job Shops
cites work: Single machine scheduling with release dates
cites work: Q5501839
cites work: The complexity of cyclic shop scheduling problems
cites work: High-multiplicity cyclic job shop scheduling
cites work: Performance Measures and Schedules in Periodic Job Shops
cites work: Computational Complexity of Discrete Optimization Problems
cites work: Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Q4250213
cites work: On some geometric methods in scheduling theory: A survey
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
cites work: List Scheduling in Order of α-Points on a Single Machine
cites work: NP-hardness of shop-scheduling problems with three jobs
cites work: A simplex based algorithm to solve separated continuous linear programs
cites work: Short Shop Schedules
DOI: 10.1007/S10951-014-0376-Y
description: scientific article; zbMATH DE number 6389259