Job-shop scheduling with blocking and no-wait constraints
type: Item
instance of: scholarly article
title: Job-shop scheduling with blocking and no-wait constraints
zbMATH Open document ID: 1082.90528
DOI: 10.1016/S0377-2217(01)00338-1
author: Alessandro Mascis
author: Dario Pacciarelli
published in: European Journal of Operational Research
publication date: 2002-11-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1832958
zbMATH Keywords: Scheduling
zbMATH Keywords: Job shop
zbMATH Keywords: Blocking
zbMATH Keywords: No-wait
describes a project that uses: JOBSHOP
MaRDI profile type: Publication
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: Predicting deadlock in store‐and‐forward networks
cites work: A three-dimensional matching model for perishable production scheduling
cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
cites work: Disjunctive Programming
cites work: A branch and bound algorithm for the job-shop scheduling problem
cites work: The one-machine sequencing problem
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Adjustment of heads and tails for the job-shop problem
cites work: A genetic algorithm for the job shop problem
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Q3938812
cites work: Q4233361
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: An efficient algorithm for a job shop problem
cites work: A mathematical programming model for scheduling steelmaking-continuous casting production
cites work: A new approach to computing optimal schedules for the job-shop scheduling problem
cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
cites work: Perishable Inventory Theory: A Review
cites work: The permutation flow shop with buffers: A tabu search approach
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
cites work: Flowshop scheduling with limited temporary storage
cites work: Q3525910
cites work: Problem and Heuristic Space Search Strategies for Job Shop Scheduling
cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
cites work: Q3713852
cites work: Job Shop Scheduling by Simulated Annealing
description: scientific article; zbMATH DE number 1832958