Minimizing makespan in a multimode multiprocessor shop scheduling problem

Bianco, Lucio; Dell'Olmo, Paolo; Giordani, Stefano; Speranza, Maria

doi:10.1002/(sici)1520-6750(199912)46:8<893::aid-nav2>3.0.co;2-7

Cited by 14 publications

(15 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We base our mathematical formulation of videotape duplication scheduling on prior formulations found in Talbot (1982) and Bianco, Dell'Olmo, Giordani, and Speranza (1999). Using the notation from Bianco et al (1999), let P = {P 1 ,.…”

Section: Mathematical Programming Formulationmentioning

confidence: 99%

“…Let represent the set of all possible sets S. Specifying the subtask set S allows the videotape duplication problem to take advantage of the problem formulation found in Bianco et al (1999). In fact, the partitioning of jobs into subtasks is quite similar to the actions taken by human schedulers in the real videotape duplication system to ensure that single jobs do not grab too many duplication resources at any one time.…”

Section: Mathematical Programming Formulationmentioning

confidence: 99%

“…In fact, the partitioning of jobs into subtasks is quite similar to the actions taken by human schedulers in the real videotape duplication system to ensure that single jobs do not grab too many duplication resources at any one time. For simplicity and to maintain consistency with Bianco et al's (1999) notation, we assume that the subtasks in the set S are re-indexed into the set of tasks T = {T 1 ,. .…”

Section: Mathematical Programming Formulationmentioning

confidence: 99%

“…Then, task T n becomes the dummy subtask (S end ). Adopting Bianco et al's (1999) approach and notation, we let x ikt be a binary variable as follows:…”

Section: Mathematical Programming Formulationmentioning

confidence: 99%

“…Then the videotape duplication scheduling problem, for a single chosen set of subtasks S, can be formulated to minimize makespan as follows (Bianco et al, 1999;Talbot, 1982):…”

Section: Mathematical Programming Formulationmentioning

confidence: 99%

See 4 more Smart Citations

Mass Customization in Videotape Duplication and Conversion: Challenges of Flexible Duplication Systems, Fast Delivery, and Electronic Service

Heim¹

2004

Int J Flex Manuf Syst

View full text Add to dashboard Cite

With the emergence of electronic commerce technology, marketers gained new methods for personalizing electronic advertisements, automating marketing research, and customizing product designs. These developments suggest that production operations also must be redesigned to support contemporary marketing objectives via mass customization. Yet, operations management research historically has focused on mass production systems buffering the customer from production operations. As such, the literature provides relatively few insights about managing mass customization operations. Thus, in this paper, we consider a previously unexamined type of mass customization production operations. The paper presents a case study of a manufacturer's videotape duplication and conversion system, consisting of a flexible network of heterogeneous, parallel machines used to duplicate and convert videotapes and other multimedia. We describe the characteristics of this flexible duplication system, discuss parallels between these systems and mass customization, and identify issues regarding flexibility, speed of delivery, and electronic service.

show abstract

Section: Mathematical Programming Formulationmentioning

confidence: 99%

Section: Mathematical Programming Formulationmentioning

confidence: 99%

Section: Mathematical Programming Formulationmentioning

confidence: 99%

“…Then, task T n becomes the dummy subtask (S end ). Adopting Bianco et al's (1999) approach and notation, we let x ikt be a binary variable as follows:…”

Section: Mathematical Programming Formulationmentioning

confidence: 99%

“…Then the videotape duplication scheduling problem, for a single chosen set of subtasks S, can be formulated to minimize makespan as follows (Bianco et al, 1999;Talbot, 1982):…”

Section: Mathematical Programming Formulationmentioning

confidence: 99%

See 3 more Smart Citations

Mass Customization in Videotape Duplication and Conversion: Challenges of Flexible Duplication Systems, Fast Delivery, and Electronic Service

Heim¹

2004

Int J Flex Manuf Syst

View full text Add to dashboard Cite

show abstract

Parallel Tasks

Drozdowski¹

2009

Scheduling for Parallel Processing

View full text Add to dashboard Cite

A new approach for scheduling independent tasks with multiple modes

Caramia

Giordani

2007

J Heuristics

Self Cite

View full text Add to dashboard Cite

Heuristic algorithms for scheduling tasks with multiple modes and minimizing the schedule length involve in general two distinct phases, task mode assignment and then task scheduling. We propose a novel approach where these two features are managed in an integrated mechanism with mode assignment embedded in scheduling. The problem is first reformulated as a special single-mode task scheduling problem, and then is modeled as a graph interval T -coloring. Finally, a tabu-like metaheuristic is proposed for this latter graph coloring problem, and the performance of our approach is compared to known multi-mode scheduling heuristics

show abstract

Minimizing makespan in a multimode multiprocessor shop scheduling problem

Cited by 14 publications

References 19 publications

Mass Customization in Videotape Duplication and Conversion: Challenges of Flexible Duplication Systems, Fast Delivery, and Electronic Service

Mass Customization in Videotape Duplication and Conversion: Challenges of Flexible Duplication Systems, Fast Delivery, and Electronic Service

Parallel Tasks

A new approach for scheduling independent tasks with multiple modes

Contact Info

Product

Resources

About