Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots (Q420153): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Summary: Handling rapidly evolving technology and almost daily changes in demand and customer satisfaction, while maintaining competitiveness in a highly competitive environment, requires good coordination and planning of both production and logistics activities on the shop floor, namely: machines and tools. The goal is to optimize costs and reduce delivery lead times in order to provide the customer just in time; we focus on the job shop scheduling problem (JSSP), which is one of the most complex problems encountered in real shop floor. In this paper, we study a generalized (JSSP) including transportation times and a set of additional constraints on the number of transporter vehicles and their multiple transfer capabilities and also on the limited capacity of input/output of machines. The objective is to minimize in one hand tardiness and earliness penalties on delays and advances compared to the lead-time delivery of finished jobs and on the other hand the number of empty moves of transporter vehicles. | |||
Property / review text: Summary: Handling rapidly evolving technology and almost daily changes in demand and customer satisfaction, while maintaining competitiveness in a highly competitive environment, requires good coordination and planning of both production and logistics activities on the shop floor, namely: machines and tools. The goal is to optimize costs and reduce delivery lead times in order to provide the customer just in time; we focus on the job shop scheduling problem (JSSP), which is one of the most complex problems encountered in real shop floor. In this paper, we study a generalized (JSSP) including transportation times and a set of additional constraints on the number of transporter vehicles and their multiple transfer capabilities and also on the limited capacity of input/output of machines. The objective is to minimize in one hand tardiness and earliness penalties on delays and advances compared to the lead-time delivery of finished jobs and on the other hand the number of empty moves of transporter vehicles. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6036994 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.5402/2011/165620 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2041845222 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58689013 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic job-shop scheduling: Past, present and future / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic job shop scheduling using variable neighbourhood search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mixed binary integer programming formulations for the reentrant job shop scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new neighborhood and tabu search for the blocking job shop / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ant colony optimization combined with taboo search for the job shop scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of flow shop scheduling problems with transportation constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Machine scheduling with transportation considerations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A tabu search algorithm for scheduling a single robot in a job-shop environment / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tabu search algorithms for job-shop problems with a single transport robot / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simultaneous job input sequencing and vehicle dispatching in a single-vehicle automated guided vehicle system: a heuristic branch-and-bound approach coupled with a discrete events simulation model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integrated production and material handling scheduling using mathematical programming and constraint programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the complexity of flow shop scheduling with transportation constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Job-shop scheduling with limited capacity buffers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An MILP for scheduling problems in an FMS with one vehicle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lagrangian bounds for just-in-time job-shop scheduling / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:43, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots |
scientific article |
Statements
Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots (English)
0 references
21 May 2012
0 references
Summary: Handling rapidly evolving technology and almost daily changes in demand and customer satisfaction, while maintaining competitiveness in a highly competitive environment, requires good coordination and planning of both production and logistics activities on the shop floor, namely: machines and tools. The goal is to optimize costs and reduce delivery lead times in order to provide the customer just in time; we focus on the job shop scheduling problem (JSSP), which is one of the most complex problems encountered in real shop floor. In this paper, we study a generalized (JSSP) including transportation times and a set of additional constraints on the number of transporter vehicles and their multiple transfer capabilities and also on the limited capacity of input/output of machines. The objective is to minimize in one hand tardiness and earliness penalties on delays and advances compared to the lead-time delivery of finished jobs and on the other hand the number of empty moves of transporter vehicles.
0 references
0 references
0 references
0 references
0 references