The job shop scheduling problem with convex costs

DOI10.1016/j.ejor.2018.01.027zbMath1403.90309OpenAlexW2793396949MaRDI QIDQ1754305

Kerem Bülbül, Reinhard Bürgy

Publication date: 30 May 2018

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

Full work available at URL: http://research.sabanciuniv.edu/34933/1/JS-conv_Paper-GERADTemplate_2.pdf

zbMATH Keywords

schedulingtabu searchjob shopconvex costsnon-regular objective

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A survey of job shop scheduling problem: the types and models ⋮ Shop scheduling in manufacturing environments: a review ⋮ A meta-heuristic to solve the just-in-time job-shop scheduling problem

Uses Software

• LSTF
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• Tabu search algorithms for job-shop problems with a single transport robot
• The flexible blocking job shop with transfer and set-up times
• Minimizing total weighted tardiness in a generalized job shop
• Parallel machine match-up scheduling with manufacturing cost considerations
• Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
• LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems
• An alternative framework to Lagrangian relaxation approach for job shop scheduling.
• Job-shop scheduling with processing alternatives.
• A large step random walk for minimizing total weighted tardiness in a job shop
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
• Deterministic job-shop scheduling: Past, present and future
• Advanced production scheduling for batch plants in process industries
• A hybrid approach to scheduling with earliness and tardiness costs
• Focused simulated annealing search: An application to job shop scheduling
• The no-wait job shop with regular objective: a method based on optimal job insertion
• Routing and scheduling in a flexible job shop by tabu search
• A survey of scheduling with controllable processing times
• A neighborhood for complex job shop scheduling problems with regular objectives
• A linear programming-based method for job shop scheduling
• Lagrangian bounds for just-in-time job-shop scheduling
• An advanced tabu search algorithm for the job shop problem
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• Solving the Convex Cost Integer Dual Network Flow Problem
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
• Blood Inventory Management: An Overview of Theory and Practice
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• Minimizing Job Idleness in Deadline Constrained Environments
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Multiple Variable-Speed Machines
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Job shop scheduling with a non-regular objective: A comparison of neighbourhood structures based on a sequencing/timing decomposition
• Timing problems and algorithms: Time decisions for sequences of activities
• Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems
• Dantzig-Wolfe Decomposition for Job Shop Scheduling
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Job Shop Scheduling by Local Search
• The blocking job shop with rail-bound transportation

This page was built for publication: The job shop scheduling problem with convex costs