Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
type: Item
instance of: scholarly article
title: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
zbMATH Open document ID: 0970.90034
DOI: 10.1016/S0377-2217(99)00285-4
author: W. H. M. Raaymakers
author: Han Hoogeveen
published in: European Journal of Operational Research
publication date: 2000-11-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 1525581
zbMATH Keywords: production scheduling
zbMATH Keywords: multipurpose batch process industries
zbMATH Keywords: multiprocessor no-wait job shop
zbMATH Keywords: simulated annealing algorithm
MaRDI profile type: Publication
cites work: Q4339078
cites work: The job shop scheduling problem: Conventional and new solution techniques
cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan
cites work: No-wait shop scheduling: Computational complexity and approximate algorithms
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: The complexity of scheduling jobs in repetitive manufacturing systems
cites work: A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
cites work: Q4124328
cites work: A Scheduling Problem*
cites work: Complexity of Scheduling Shops with No Wait in Process
cites work: Some no-wait shops scheduling problems: Complexity aspect
cites work: Job Shop Scheduling by Local Search
cites work: Q3809582
cites work: Q3785827
cites work: Q4848729
full work available at URL: s0377-2217(99)00285-4
OpenAlex ID: W2170716909
description: scientific article; zbMATH DE number 1525581