On a scheduling problem in a robotized analytical system

DOI10.1016/0166-218X(95)00039-TMaRDI QIDQ1917278zbMATH OpenOpenAlexFDO

Authors Alain Hertz, Yves Mottet, Yves Rochat

Publication date 7 July 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(95)00039-t

zbMATH Keywords

heuristic schedulingno-wait constraintsrobotized analytical system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A genetic approach for solving a scheduling problem in a robotized analytical system
• Resolution of a scheduling problem in a flowshop robotic cell
• An analysis of cyclic scheduling problems in robot centered cells
• A stochastic optimization approach for robot scheduling
• Robotized sorting systems: large-scale scheduling under real-time conditions with limited lookahead
• Scheduling in robotic cells: Complexity and steady state analysis
• New complexity results on scheduling problem in a robotic cell
• Application of ELSP solution techniques to the deterministic robotic scheduling problem
• Scheduling a two-machine robotic cell: A solvable case

Cites work

• A Fast Taboo Search Algorithm for the Job Shop Problem
• A new heuristic method for the flow shop sequencing problem
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A tabu search experience in production scheduling
• An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
• Applying tabu search to the job-shop scheduling problem
• Complexity of Scheduling Shops with No Wait in Process
• Critical-Path Planning and Scheduling: Mathematical Basis
• Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case
• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3989090 (Why is no real title available?)
• scientific article; zbMATH DE number 3689114 (Why is no real title available?)
• scientific article; zbMATH DE number 3744543 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Job Shop Scheduling by Simulated Annealing
• No-wait shop scheduling: Computational complexity and approximate algorithms
• On a routing problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Ordered Flow Shop Problems with no In-Process Waiting: Further Results
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Scheduling large robotic cells without buffers
• Sequencing of robot activities and parts in two-machine robotic cells
• Some new results in flow shop scheduling

Cited in

(5)

• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
• The sample analysis machine scheduling problem: definition and comparison of exact solving approaches
• A genetic approach for solving a scheduling problem in a robotized analytical system
• A faster polynomial algorithm for 2-cyclic robotic scheduling

This page was built for publication: On a scheduling problem in a robotized analytical system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917278)