942 resultados para Close and open communion.


Relevância:

100.00% 100.00%

Publicador:

Resumo:

"Note by the editor" signed: J. E. Farnam.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

An examination of the terms of admission to the sacrament of the Lord's Supper / John J. Butler -- The children welcome to their father's table : or an apology for communing with all true believers / Enoch Mack -- The design of the Lord's Supper / David Marks -- The communion of saints the communion of the Bible / M.W. Alford.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

On cover: Baptism and communion.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The activities of governments, by their very nature, involve interactions with a broad array of public and private sector entities, from other governments, to business, academia and individual citizens. In the current era, there is a growing expectation that government programs and services will be delivered in a ‘simple, seamless and connected’ manner,1 leading to increased efficiency in government operations and improved service delivery.2 Achieving ‘collaborative, effective and efficient government and the delivery of seamless government services’ requires the implementation of interoperable technologies and procedures.3 Standards, which aim to enable organisations, platforms and systems to work with each other, are fundamental to interoperability.