The job shop scheduling problem with convex costs
type: Item
instance of: scholarly article
title: The job shop scheduling problem with convex costs
zbMATH Open document ID: 1403.90309
author: Reinhard Bürgy
author: Kerem Bülbül
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
full work available at URL: JS-conv Paper-GERADTemplate 2.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6876689
zbMATH Keywords: scheduling
zbMATH Keywords: job shop
zbMATH Keywords: non-regular objective
zbMATH Keywords: convex costs
zbMATH Keywords: tabu search
describes a project that uses: Tabu search
describes a project that uses: LSTF
MaRDI profile type: Publication
OpenAlex ID: W2793396949
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Minimizing Job Idleness in Deadline Constrained Environments
cites work: Solving the Convex Cost Integer Dual Network Flow Problem
cites work: Parallel machine match-up scheduling with manufacturing cost considerations
cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
cites work: Guided local search with shifting bottleneck for job shop scheduling
cites work: Lagrangian bounds for just-in-time job-shop scheduling
cites work: A hybrid approach to scheduling with earliness and tardiness costs
cites work: Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
cites work: Routing and scheduling in a flexible job shop by tabu search
cites work: Job shop scheduling with a non-regular objective: A comparison of neighbourhood structures based on a sequencing/timing decomposition
cites work: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
cites work: A linear programming-based method for job shop scheduling
cites work: Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
cites work: A neighborhood for complex job shop scheduling problems with regular objectives
cites work: The blocking job shop with rail-bound transportation
cites work: The no-wait job shop with regular objective: a method based on optimal job insertion
cites work: An alternative framework to Lagrangian relaxation approach for job shop scheduling.
cites work: LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems
cites work: Minimizing total weighted tardiness in a generalized job shop
cites work: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
cites work: Dantzig-Wolfe Decomposition for Job Shop Scheduling
cites work: Q4352217
cites work: Q4354785
cites work: Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
cites work: The flexible blocking job shop with transfer and set-up times
cites work: Tabu search algorithms for job-shop problems with a single transport robot
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: Job-shop scheduling with processing alternatives.
cites work: A large step random walk for minimizing total weighted tardiness in a job shop
cites work: A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
cites work: A general approach for optimizing regular criteria in the job-shop scheduling problem
cites work: Q4039868
cites work: Advanced production scheduling for batch plants in process industries
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: An advanced tabu search algorithm for the job shop problem
cites work: Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
cites work: A tabu search/path relinking algorithm to solve the job shop scheduling problem
cites work: Q4238569
cites work: Blood Inventory Management: An Overview of Theory and Practice
cites work: Focused simulated annealing search: An application to job shop scheduling
cites work: A survey of scheduling with controllable processing times
cites work: Scheduling Multiple Variable-Speed Machines
cites work: Job Shop Scheduling by Local Search
cites work: Job Shop Scheduling by Simulated Annealing
cites work: Timing problems and algorithms: Time decisions for sequences of activities
cites work: Q4848729
cites work: Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems
DOI: 10.1016/J.EJOR.2018.01.027
description: scientific article; zbMATH DE number 6876689