On a scheduling problem in a robotized analytical system
type: Item
instance of: scholarly article
title: On a scheduling problem in a robotized analytical system
zbMATH Open document ID: 0846.90048
DOI: 10.1016/0166-218X(95)00039-T
author: Alain Hertz
author: Yves Mottet
author: Yves Rochat
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 897385
zbMATH Keywords: no-wait constraints
zbMATH Keywords: robotized analytical system
zbMATH Keywords: heuristic scheduling
MaRDI profile type: Publication
cites work: A tabu search experience in production scheduling
cites work: On a routing problem
cites work: Q3751359
cites work: Q4131987
cites work: Q4658190
cites work: Q3619797
cites work: Applying tabu search to the job-shop scheduling problem
cites work: No-wait shop scheduling: Computational complexity and approximate algorithms
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
cites work: Scheduling large robotic cells without buffers
cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
cites work: An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
cites work: Critical-Path Planning and Scheduling: Mathematical Basis
cites work: A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
cites work: Job Shop Scheduling by Simulated Annealing
cites work: Q3339651
cites work: Q3929047
cites work: Q4124328
cites work: Sequencing of robot activities and parts in two-machine robotic cells
cites work: Q3883869
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case
cites work: Ordered Flow Shop Problems with no In-Process Waiting: Further Results
cites work: On the Flow-Shop Sequencing Problem with No Wait in Process†
cites work: Some new results in flow shop scheduling
cites work: Complexity of Scheduling Shops with No Wait in Process
cites work: A new heuristic method for the flow shop sequencing problem
full work available at URL: 0166-218x(95)00039-t
OpenAlex ID: W2071530270
Recommended article: A genetic approach for solving a scheduling problem in a robotized analytical system
Recommended article: Resolution of a scheduling problem in a flowshop robotic cell
Recommended article: An analysis of cyclic scheduling problems in robot centered cells
Recommended article: A stochastic optimization approach for robot scheduling
Recommended article: Robotized sorting systems: large-scale scheduling under real-time conditions with limited lookahead
Recommended article: Scheduling in robotic cells: Complexity and steady state analysis
Recommended article: New complexity results on scheduling problem in a robotic cell
Recommended article: Application of ELSP solution techniques to the deterministic robotic scheduling problem
Recommended article: Scheduling a two-machine robotic cell: A solvable case
description: scientific article; zbMATH DE number 897385