Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks
Article Abstract:
A bidding scheme expressing pricetime trade-off and a multi-commodity network model are proposed to address the problem of planning and scheduling multiproduct orders in symbiotic manufacturing networks. The model provides a structured scheduling methodology which the bid requestor can apply in the decision process, given sets of bids from networked contractors. Significant issues include limited bidden time windows, internal and external operators, the uncertainty level of the bidded proposals, the conversion of the costing function into a pricing function and the iterative nature of the decision process.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
Scheduling with batch setup times and earliness-tardiness penalties
Article Abstract:
Two special cases of the problem of scheduling several batches of jobs on a single machine are considered. The problem, which involves setup times as well as earliness and tardiness penalties, assigns a common due date for all jobs in a single batch. The first case requires finding an optimal schedule that will minimize the total penalties for an externally given due date while the second requires an optimal schedule and due date that will minimize both total penalties and due date penalty for due dates that are decision variables.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
Single machine earliness and tardiness scheduling
Article Abstract:
A branch-and-bound procedure and a heuristic for solving the single-machine earliness and tardiness problem without considering machine idle time are proposed. The former, which employs multiplier adjustment schemes to solve two Lagrangian dual subproblems, provides solutions with up to 50 jobs. In contrast, the neighborhood search-based heuristic generates optimal to near optimal solutions for problems with up to 3,000 jobs.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Inspection sequencing and part scheduling for flexible manufacturing systems. Genetic algorithms for the two-stage bicriteria flowshop problem
- Abstracts: Leaderless Russia: the continuing bad health of Russia's president may mean another election - sooner rather than later
- Abstracts: A curved cable-stayed crossing, like ships in the harbour, offers motorists changing views of the area
- Abstracts: Steel in the frame: a round-up of recent developments in steel's fire and environmental performance, steel construction systems and composite panels
- Abstracts: Product review. Theme: membrane roofing